./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7dc718442bb91da0bdb0fa6a159b603baccf5b9195c06341082ea90462d0b755 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:07:28,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:07:28,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:07:28,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:07:28,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:07:28,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:07:28,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:07:28,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:07:28,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:07:28,800 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:07:28,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:07:28,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:07:28,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:07:28,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:07:28,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:07:28,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:28,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:07:28,802 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7dc718442bb91da0bdb0fa6a159b603baccf5b9195c06341082ea90462d0b755 [2025-03-03 15:07:29,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:07:29,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:07:29,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:07:29,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:07:29,045 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:07:29,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-03 15:07:30,206 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f8039c5/5c4908c7bf0d4664a84ae927c93ba5e5/FLAG76e6391e3 [2025-03-03 15:07:30,633 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:07:30,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-03 15:07:30,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f8039c5/5c4908c7bf0d4664a84ae927c93ba5e5/FLAG76e6391e3 [2025-03-03 15:07:30,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f8039c5/5c4908c7bf0d4664a84ae927c93ba5e5 [2025-03-03 15:07:30,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:07:30,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:07:30,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:30,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:07:30,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:07:30,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:30" (1/1) ... [2025-03-03 15:07:30,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca44fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:30, skipping insertion in model container [2025-03-03 15:07:30,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:30" (1/1) ... [2025-03-03 15:07:30,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:07:31,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26861,26874] [2025-03-03 15:07:31,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33212,33225] [2025-03-03 15:07:31,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[57844,57857] [2025-03-03 15:07:31,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[65899,65912] [2025-03-03 15:07:31,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71726,71739] [2025-03-03 15:07:31,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82469,82482] [2025-03-03 15:07:31,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90414,90427] [2025-03-03 15:07:31,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[97642,97655] [2025-03-03 15:07:31,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132349,132362] [2025-03-03 15:07:31,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[135477,135490] [2025-03-03 15:07:31,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[143490,143503] [2025-03-03 15:07:31,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[149294,149307] [2025-03-03 15:07:31,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[172040,172053] [2025-03-03 15:07:31,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[199876,199889] [2025-03-03 15:07:31,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226429,226442] [2025-03-03 15:07:31,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[253730,253743] [2025-03-03 15:07:31,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[284837,284850] [2025-03-03 15:07:31,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:31,798 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:07:31,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26861,26874] [2025-03-03 15:07:31,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33212,33225] [2025-03-03 15:07:31,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[57844,57857] [2025-03-03 15:07:31,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[65899,65912] [2025-03-03 15:07:31,901 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[71726,71739] [2025-03-03 15:07:31,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82469,82482] [2025-03-03 15:07:31,921 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90414,90427] [2025-03-03 15:07:31,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[97642,97655] [2025-03-03 15:07:31,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[132349,132362] [2025-03-03 15:07:31,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[135477,135490] [2025-03-03 15:07:32,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[143490,143503] [2025-03-03 15:07:32,030 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[149294,149307] [2025-03-03 15:07:32,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[172040,172053] [2025-03-03 15:07:32,076 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[199876,199889] [2025-03-03 15:07:32,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[226429,226442] [2025-03-03 15:07:32,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[253730,253743] [2025-03-03 15:07:32,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[284837,284850] [2025-03-03 15:07:32,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:32,266 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:07:32,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32 WrapperNode [2025-03-03 15:07:32,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:32,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:32,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:07:32,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:07:32,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,577 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18003 [2025-03-03 15:07:32,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:32,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:07:32,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:07:32,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:07:32,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:07:32,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:07:32,970 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:07:32,971 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:07:32,971 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:07:32,972 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (1/1) ... [2025-03-03 15:07:32,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:32,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:33,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:07:33,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:07:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:07:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:07:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:07:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:07:33,371 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:07:33,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:07:39,370 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27983: havoc main_~node1__m1~155#1;havoc main_~__tmp_177~0#1, main_~assert__arg~176#1;havoc main_~check__tmp~182#1;havoc main_~node4____CPAchecker_TMP_1~32#1; [2025-03-03 15:07:39,370 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17942: havoc main_~node1____CPAchecker_TMP_0~11#1; [2025-03-03 15:07:39,370 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15302: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8963: havoc main_~node2__m2~38#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~55#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24821: havoc main_~node1__m1~132#1;havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~159#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4211: havoc main_~check__tmp~23#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24295: havoc main_~node4__m4~95#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23768: havoc main_~node1____CPAchecker_TMP_0~22#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13198: havoc main_~node3__m3~48#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~65#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~84#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31168: havoc main_~node2____CPAchecker_TMP_1~15#1;havoc main_~node2__m2~135#1;havoc main_~node1____CPAchecker_TMP_1~35#1;havoc main_~node1__m1~179#1;havoc main_~__tmp_201~0#1, main_~assert__arg~200#1;havoc main_~check__tmp~206#1;havoc main_~node4__m4~120#1;havoc main_~node3__m3~113#1;havoc main_~node2__m2~134#1;havoc main_~node1__m1~178#1;havoc main_~__tmp_200~0#1, main_~assert__arg~199#1;havoc main_~check__tmp~205#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24305: havoc main_~node4____CPAchecker_TMP_0~27#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11097: havoc main_~node4__m4~39#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~70#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17971: havoc main_~node1____CPAchecker_TMP_1~10#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13744: havoc main_~node3__m3~52#1; [2025-03-03 15:07:39,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15330: havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27490: havoc main_~node4__m4~106#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25904: havoc main_~node4__m4~99#1;havoc main_~node3__m3~98#1;havoc main_~node2__m2~115#1;havoc main_~node1__m1~140#1;havoc main_~__tmp_162~0#1, main_~assert__arg~161#1;havoc main_~check__tmp~167#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9522: havoc main_~node2__m2~42#1;havoc main_~node1__m1~45#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~59#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14807: havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13754: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23796: havoc main_~node1____CPAchecker_TMP_1~22#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2659: havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27500: havoc main_~node4____CPAchecker_TMP_0~32#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15874: havoc main_~node1__m1~79#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~101#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~74#1;havoc main_~node1__m1~78#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~100#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10061: havoc main_~node2__m2~46#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~63#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19047: havoc main_~node4__m4~73#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~87#1;havoc main_~node1__m1~96#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~121#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29617: havoc main_~node2__m2~129#1;havoc main_~node1____CPAchecker_TMP_1~32#1;havoc main_~node1__m1~168#1;havoc main_~__tmp_190~0#1, main_~assert__arg~189#1;havoc main_~check__tmp~195#1;havoc main_~node4__m4~114#1;havoc main_~node3__m3~109#1;havoc main_~node2__m2~128#1;havoc main_~node1__m1~167#1;havoc main_~__tmp_189~0#1, main_~assert__arg~188#1;havoc main_~check__tmp~194#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13763: havoc main_~node4__m4~48#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16406: havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~105#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~76#1;havoc main_~node1__m1~81#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~104#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7422: havoc main_~node1__m1~32#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~45#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~44#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15884: havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-03 15:07:39,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17998: havoc main_~node2__m2~83#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24342: havoc main_~node1__m1~128#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~155#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13773: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14835: havoc main_~node1____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15365: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18008: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28579: havoc main_~node1____CPAchecker_TMP_1~30#1;havoc main_~node1__m1~160#1;havoc main_~__tmp_182~0#1, main_~assert__arg~181#1;havoc main_~check__tmp~187#1;havoc main_~node4__m4~110#1;havoc main_~node3__m3~106#1;havoc main_~node2__m2~124#1;havoc main_~node1__m1~159#1;havoc main_~__tmp_181~0#1, main_~assert__arg~180#1;havoc main_~check__tmp~186#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22766: havoc main_~node1____CPAchecker_TMP_1~21#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12729: havoc main_~node3__m3~45#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~81#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10615: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~67#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~66#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2159: havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~10#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631: havoc main_~check__tmp~7#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~6#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19603: havoc main_~node1__m1~100#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~125#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~76#1;havoc main_~node2__m2~89#1;havoc main_~node1__m1~99#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~124#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27537: havoc main_~node1__m1~152#1;havoc main_~__tmp_174~0#1, main_~assert__arg~173#1;havoc main_~check__tmp~179#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15912: havoc main_~node1____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5871: havoc main_~node1__m1~25#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~35#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~34#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19613: havoc main_~node1____CPAchecker_TMP_0~14#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30713: havoc main_~node2__m2~133#1;havoc main_~node1____CPAchecker_TMP_1~34#1;havoc main_~node1__m1~176#1;havoc main_~__tmp_198~0#1, main_~assert__arg~197#1;havoc main_~check__tmp~203#1;havoc main_~node4__m4~119#1;havoc main_~node3__m3~112#1;havoc main_~node2__m2~132#1;havoc main_~node1__m1~175#1;havoc main_~__tmp_197~0#1, main_~assert__arg~196#1;havoc main_~check__tmp~202#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6935: havoc main_~node4__m4~26#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~41#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22792: havoc main_~node2__m2~105#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18036: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15393: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:39,373 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29664: havoc main_~node2____CPAchecker_TMP_0~10#1; [2025-03-03 15:07:39,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3769: havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:39,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14343: havoc main_~node4__m4~51#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~71#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~92#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-03 15:07:39,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18571: havoc main_~node1__m1~94#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~119#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~72#1;havoc main_~node2__m2~85#1;havoc main_~node1__m1~93#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~118#1; [2025-03-03 15:07:39,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22802: havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:39,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8004: havoc main_~node1__m1~35#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~49#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~48#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27032: havoc main_~node1__m1~149#1;havoc main_~__tmp_171~0#1, main_~assert__arg~170#1;havoc main_~check__tmp~176#1;havoc main_~node4__m4~104#1;havoc main_~node3__m3~101#1;havoc main_~node2__m2~119#1;havoc main_~node1__m1~148#1;havoc main_~__tmp_170~0#1, main_~assert__arg~169#1;havoc main_~check__tmp~175#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1135: havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7480: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19641: havoc main_~node1____CPAchecker_TMP_1~13#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22812: havoc main_~node3__m3~87#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8014: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25986: havoc main_~node4__m4~100#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17005: havoc main_~node1__m1~85#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~109#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~79#1;havoc main_~node1__m1~84#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~108#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29692: havoc main_~node2____CPAchecker_TMP_1~13#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22822: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8553: havoc main_~node2__m2~35#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~52#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25996: havoc main_~node4____CPAchecker_TMP_0~30#1; [2025-03-03 15:07:39,375 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21769: havoc main_~node1__m1~113#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~139#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~98#1;havoc main_~node1__m1~112#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~138#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15428: havoc main_~node1____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19129: havoc main_~node4__m4~74#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12259: havoc main_~node1__m1~60#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~79#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~78#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22831: havoc main_~node4__m4~89#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30760: havoc main_~node2____CPAchecker_TMP_0~11#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5393: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~31#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~30#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24949: havoc main_~node3__m3~94#1;havoc main_~node2__m2~112#1;havoc main_~node1__m1~133#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~160#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7508: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21779: havoc main_~node1____CPAchecker_TMP_0~19#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23367: havoc main_~node4__m4~91#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~107#1;havoc main_~node1__m1~121#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~148#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19139: havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9098: havoc main_~node2__m2~39#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~56#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8042: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22841: havoc main_~node4____CPAchecker_TMP_0~25#1; [2025-03-03 15:07:39,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5929: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20201: havoc main_~node1__m1~104#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~129#1;havoc main_~node4__m4~78#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~91#1;havoc main_~node1__m1~103#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~128#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30244: havoc main_~node1__m1~172#1;havoc main_~__tmp_194~0#1, main_~assert__arg~193#1;havoc main_~check__tmp~199#1;havoc main_~node4____CPAchecker_TMP_1~35#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29190: havoc main_~node1__m1~165#1;havoc main_~__tmp_187~0#1, main_~assert__arg~186#1;havoc main_~check__tmp~192#1;havoc main_~node4__m4~113#1;havoc main_~node3__m3~108#1;havoc main_~node2__m2~126#1;havoc main_~node1__m1~164#1;havoc main_~__tmp_186~0#1, main_~assert__arg~185#1;havoc main_~check__tmp~191#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21267: havoc main_~node4__m4~83#1;havoc main_~node3__m3~82#1;havoc main_~node2__m2~96#1;havoc main_~node1__m1~109#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~135#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20211: havoc main_~node1____CPAchecker_TMP_0~16#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3300: havoc main_~node4__m4~11#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26556: havoc main_~node1__m1~146#1;havoc main_~__tmp_168~0#1, main_~assert__arg~167#1;havoc main_~check__tmp~173#1;havoc main_~node4__m4~102#1;havoc main_~node3__m3~100#1;havoc main_~node2__m2~117#1;havoc main_~node1__m1~145#1;havoc main_~__tmp_167~0#1, main_~assert__arg~166#1;havoc main_~check__tmp~172#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18629: havoc main_~node1____CPAchecker_TMP_0~12#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30788: havoc main_~node2____CPAchecker_TMP_1~14#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27090: havoc main_~node1____CPAchecker_TMP_0~24#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26033: havoc main_~node1__m1~141#1;havoc main_~__tmp_163~0#1, main_~assert__arg~162#1;havoc main_~check__tmp~168#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29206: havoc main_~node1____CPAchecker_TMP_1~31#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3310: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21808: havoc main_~node1____CPAchecker_TMP_1~18#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13356: havoc main_~node3__m3~49#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~85#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5957: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9657: havoc main_~node2__m2~43#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~60#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26572: havoc main_~node1____CPAchecker_TMP_1~26#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17063: havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22878: havoc main_~node1__m1~118#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~144#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25522: havoc main_~node1__m1~138#1;havoc main_~__tmp_160~0#1, main_~assert__arg~159#1;havoc main_~check__tmp~165#1;havoc main_~node4__m4~98#1;havoc main_~node3__m3~97#1;havoc main_~node2__m2~114#1;havoc main_~node1__m1~137#1;havoc main_~__tmp_159~0#1, main_~assert__arg~158#1;havoc main_~check__tmp~164#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11781: havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~75#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~74#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10196: havoc main_~node2__m2~47#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~64#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4911: havoc main_~node4__m4~16#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~27#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20240: havoc main_~node1____CPAchecker_TMP_1~15#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24470: havoc main_~node3__m3~92#1;havoc main_~node2__m2~110#1;havoc main_~node1__m1~129#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~156#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18657: havoc main_~node1____CPAchecker_TMP_1~11#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12317: havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:39,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7032: havoc main_~node4__m4~27#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27118: havoc main_~node1____CPAchecker_TMP_1~27#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29233: havoc main_~node2__m2~127#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28179: havoc main_~node1____CPAchecker_TMP_1~29#1;havoc main_~node1__m1~157#1;havoc main_~__tmp_179~0#1, main_~assert__arg~178#1;havoc main_~check__tmp~184#1;havoc main_~node4__m4~108#1;havoc main_~node3__m3~104#1;havoc main_~node2__m2~123#1;havoc main_~node1__m1~156#1;havoc main_~__tmp_178~0#1, main_~assert__arg~177#1;havoc main_~check__tmp~183#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13910: havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~89#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~69#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~88#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18138: havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17611: havoc main_~node1__m1~89#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~113#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~68#1;havoc main_~node2__m2~81#1;havoc main_~node1__m1~88#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~112#1;havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22368: havoc main_~node1__m1~117#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~143#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~101#1;havoc main_~node1__m1~116#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~142#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6513: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~39#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~38#1; [2025-03-03 15:07:39,378 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7042: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-03 15:07:39,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16027: havoc main_~node4__m4~59#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:39,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23955: havoc main_~node1__m1~125#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~152#1;havoc main_~node4____CPAchecker_TMP_1~26#1; [2025-03-03 15:07:39,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26599: havoc main_~node2__m2~118#1; [2025-03-03 15:07:39,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29243: havoc main_~node2____CPAchecker_TMP_0~9#1; [2025-03-03 15:07:39,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17091: havoc main_~node1____CPAchecker_TMP_1~7#1; [2025-03-03 15:07:39,380 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20791: havoc main_~node1__m1~107#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~133#1;havoc main_~node4__m4~81#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~94#1;havoc main_~node1__m1~106#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~132#1; [2025-03-03 15:07:39,380 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22378: havoc main_~node1____CPAchecker_TMP_0~21#1; [2025-03-03 15:07:39,380 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16037: havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-03 15:07:39,380 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21851: havoc main_~node2____CPAchecker_TMP_1~5#1;havoc main_~node2__m2~99#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12345: havoc main_~node1____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22388: havoc main_~node2__m2~102#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18164: havoc main_~node3__m3~70#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20283: havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2__m2~92#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28740: havoc main_~node1__m1~161#1;havoc main_~__tmp_183~0#1, main_~assert__arg~182#1;havoc main_~check__tmp~188#1;havoc main_~node4____CPAchecker_TMP_1~33#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11299: havoc main_~node4__m4~40#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~71#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12886: havoc main_~node3__m3~46#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~82#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2845: havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29271: havoc main_~node2____CPAchecker_TMP_1~12#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21343: havoc main_~node4__m4~84#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18174: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25580: havoc main_~node1____CPAchecker_TMP_0~23#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21353: havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18183: havoc main_~node4__m4~69#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23470: havoc main_~node4__m4~92#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26646: havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25062: havoc main_~node1__m1~134#1;havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~161#1;havoc main_~node4____CPAchecker_TMP_1~28#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16606: havoc main_~node4__m4~62#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~77#1;havoc main_~node1__m1~82#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~106#1;havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18193: havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23480: havoc main_~node4____CPAchecker_TMP_0~26#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8683: havoc main_~node2__m2~36#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~53#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3398: havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17669: havoc main_~node1____CPAchecker_TMP_0~10#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29828: havoc main_~node4__m4~115#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8161: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22435: havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20849: havoc main_~node1____CPAchecker_TMP_0~17#1; [2025-03-03 15:07:39,381 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25608: havoc main_~node1____CPAchecker_TMP_1~24#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27723: havoc main_~node1__m1~154#1;havoc main_~__tmp_176~0#1, main_~assert__arg~175#1;havoc main_~check__tmp~181#1;havoc main_~node4__m4~107#1;havoc main_~node3__m3~103#1;havoc main_~node2__m2~121#1;havoc main_~node1__m1~153#1;havoc main_~__tmp_175~0#1, main_~assert__arg~174#1;havoc main_~check__tmp~180#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29838: havoc main_~node4____CPAchecker_TMP_0~35#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9228: havoc main_~node2__m2~40#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~57#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14517: havoc main_~node4__m4~52#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~72#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~93#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26674: havoc main_~node2____CPAchecker_TMP_1~9#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3949: havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19277: havoc main_~node1__m1~98#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~123#1;havoc main_~node4__m4~75#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~88#1;havoc main_~node1__m1~97#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~122#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30380: havoc main_~node4__m4~117#1;havoc main_~node3__m3~111#1;havoc main_~node2__m2~131#1;havoc main_~node1__m1~173#1;havoc main_~__tmp_195~0#1, main_~assert__arg~194#1;havoc main_~check__tmp~200#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17697: havoc main_~node1____CPAchecker_TMP_1~9#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27739: havoc main_~node1____CPAchecker_TMP_1~28#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5014: havoc main_~node4__m4~17#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8187: havoc main_~node3__m3~34#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4489: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~24#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23517: havoc main_~node1__m1~122#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~149#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20877: havoc main_~node1____CPAchecker_TMP_1~16#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22463: havoc main_~node2____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5024: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:39,382 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28279: havoc main_~node2____CPAchecker_TMP_1~11#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8197: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24583: havoc main_~node1__m1~130#1;havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~157#1;havoc main_~node4____CPAchecker_TMP_1~27#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9787: havoc main_~node2__m2~44#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~61#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15076: havoc main_~node1__m1~76#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~97#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~71#1;havoc main_~node1__m1~75#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~96#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29875: havoc main_~node1__m1~169#1;havoc main_~__tmp_191~0#1, main_~assert__arg~190#1;havoc main_~check__tmp~196#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8206: havoc main_~node4__m4~32#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6092: havoc main_~node4__m4~22#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27766: havoc main_~node2__m2~122#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10326: havoc main_~node2__m2~48#1;havoc main_~node1__m1~51#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~65#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6102: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8216: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30948: havoc main_~node1__m1~177#1;havoc main_~__tmp_199~0#1, main_~assert__arg~198#1;havoc main_~check__tmp~204#1;havoc main_~node4____CPAchecker_TMP_1~36#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28305: havoc main_~node3__m3~105#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8751: havoc main_~node4__m4~33#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13513: havoc main_~node3__m3~50#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~67#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~86#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11402: havoc main_~node4__m4~41#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28315: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8761: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22504: havoc main_~node2__m2~103#1; [2025-03-03 15:07:39,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10877: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~69#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~68#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1364: havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~5#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19335: havoc main_~node1____CPAchecker_TMP_0~13#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7179: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~43#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~42#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15109: havoc main_~node2__m2~72#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28324: havoc main_~node4__m4~109#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11412: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2431: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~13#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16174: havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~103#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~75#1;havoc main_~node1__m1~80#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~102#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20403: havoc main_~node4__m4~79#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27277: havoc main_~node1__m1~150#1;havoc main_~__tmp_172~0#1, main_~assert__arg~171#1;havoc main_~check__tmp~177#1;havoc main_~node4____CPAchecker_TMP_1~31#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28334: havoc main_~node4____CPAchecker_TMP_0~33#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1909: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12480: havoc main_~node4__m4~46#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9310: havoc main_~node4__m4~34#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19881: havoc main_~node1__m1~102#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~127#1;havoc main_~node4__m4~77#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~90#1;havoc main_~node1__m1~101#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~126#1;havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14599: havoc main_~node4__m4~53#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20413: havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27813: havoc main_~node2____CPAchecker_TMP_0~8#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15657: havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~99#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~73#1;havoc main_~node1__m1~77#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~98#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30456: havoc main_~node4__m4~118#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12490: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9320: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9849: havoc main_~node4__m4~35#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19363: havoc main_~node1____CPAchecker_TMP_1~12#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28876: havoc main_~node4__m4~111#1;havoc main_~node3__m3~107#1;havoc main_~node2__m2~125#1;havoc main_~node1__m1~162#1;havoc main_~__tmp_184~0#1, main_~assert__arg~183#1;havoc main_~check__tmp~189#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26235: havoc main_~node1____CPAchecker_TMP_1~25#1;havoc main_~node1__m1~143#1;havoc main_~__tmp_165~0#1, main_~assert__arg~164#1;havoc main_~check__tmp~170#1;havoc main_~node4__m4~101#1;havoc main_~node3__m3~99#1;havoc main_~node2__m2~116#1;havoc main_~node1__m1~142#1;havoc main_~__tmp_164~0#1, main_~assert__arg~163#1;havoc main_~check__tmp~169#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14609: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-03 15:07:39,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30466: havoc main_~node4____CPAchecker_TMP_0~36#1; [2025-03-03 15:07:39,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L871: havoc main_~check__tmp~3#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2025-03-03 15:07:39,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23069: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~146#1;havoc main_~node4__m4~90#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~106#1;havoc main_~node1__m1~119#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~145#1; [2025-03-03 15:07:39,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25184: havoc main_~node3__m3~95#1;havoc main_~node2__m2~113#1;havoc main_~node1__m1~135#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~162#1; [2025-03-03 15:07:39,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29413: havoc main_~node1__m1~166#1;havoc main_~__tmp_188~0#1, main_~assert__arg~187#1;havoc main_~check__tmp~193#1;havoc main_~node4____CPAchecker_TMP_1~34#1; [2025-03-03 15:07:39,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9859: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-03 15:07:39,386 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5634: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~33#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~32#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:39,387 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4049: havoc main_~node3__m3~17#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21491: havoc main_~node1__m1~111#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~137#1;havoc main_~node4__m4~85#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~97#1;havoc main_~node1__m1~110#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~136#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15151: havoc main_~node3__m3~59#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22551: havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13038: havoc main_~node3__m3~47#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~83#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8282: havoc main_~node2__m2~33#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~50#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27841: havoc main_~node2____CPAchecker_TMP_1~10#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18329: havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~117#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~71#1;havoc main_~node2__m2~84#1;havoc main_~node1__m1~92#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~116#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28371: havoc main_~node1__m1~158#1;havoc main_~__tmp_180~0#1, main_~assert__arg~179#1;havoc main_~check__tmp~185#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4059: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10402: havoc main_~node2__m2~49#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21501: havoc main_~node1____CPAchecker_TMP_0~18#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L366: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26792: havoc main_~node4__m4~103#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7767: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~47#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~33#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4068: havoc main_~node4__m4~12#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10412: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8827: havoc main_~node2__m2~37#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~54#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24158: havoc main_~node1____CPAchecker_TMP_1~23#1;havoc main_~node1__m1~127#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~154#1;havoc main_~node4__m4~94#1;havoc main_~node3__m3~91#1;havoc main_~node2__m2~109#1;havoc main_~node1__m1~126#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~153#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26802: havoc main_~node4____CPAchecker_TMP_0~31#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18874: havoc main_~node4__m4~72#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~86#1;havoc main_~node1__m1~95#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~120#1;havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30503: havoc main_~node1__m1~174#1;havoc main_~__tmp_196~0#1, main_~assert__arg~195#1;havoc main_~check__tmp~201#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4078: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10422: havoc main_~node3__m3~35#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22579: havoc main_~node2____CPAchecker_TMP_1~7#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19939: havoc main_~node1____CPAchecker_TMP_0~15#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~node2__m2~0#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3030: havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21529: havoc main_~node1____CPAchecker_TMP_1~17#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10432: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6733: havoc main_~node4__m4~25#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~40#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24705: havoc main_~node3__m3~93#1;havoc main_~node2__m2~111#1;havoc main_~node1__m1~131#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~158#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15192: havoc main_~node4__m4~56#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12022: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~77#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~76#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16780: havoc main_~node4__m4~63#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~78#1;havoc main_~node1__m1~83#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~107#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:39,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25767: havoc main_~node1__m1~139#1;havoc main_~__tmp_161~0#1, main_~assert__arg~160#1;havoc main_~check__tmp~166#1;havoc main_~node4____CPAchecker_TMP_1~29#1; [2025-03-03 15:07:39,389 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10441: havoc main_~node4__m4~36#1; [2025-03-03 15:07:39,389 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9386: havoc main_~node2__m2~41#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~58#1; [2025-03-03 15:07:39,390 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14143: havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~91#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~70#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~90#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5161: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~29#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~28#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node3__m3~0#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10451: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9925: havoc main_~node2__m2~45#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~62#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19967: havoc main_~node1____CPAchecker_TMP_1~14#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3584: havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26839: havoc main_~node1__m1~147#1;havoc main_~__tmp_169~0#1, main_~assert__arg~168#1;havoc main_~check__tmp~174#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12571: havoc main_~node3__m3~44#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~80#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22614: havoc main_~node1____CPAchecker_TMP_1~20#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28958: havoc main_~node4__m4~112#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17332: havoc main_~node1__m1~87#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~111#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~80#1;havoc main_~node1__m1~86#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~110#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6235: havoc main_~check__tmp~37#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~36#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13107: havoc main_~node4__m4~47#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25263: havoc main_~node3__m3~96#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L425: havoc main_~node4__m4~0#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22096: havoc main_~node1__m1~115#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~141#1;havoc main_~node4__m4~87#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~100#1;havoc main_~node1__m1~114#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~140#1;havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28968: havoc main_~node4____CPAchecker_TMP_0~34#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17342: havoc main_~node1____CPAchecker_TMP_0~9#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1488: havoc main_~node4__m4~5#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13117: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25273: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L435: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22106: havoc main_~node1____CPAchecker_TMP_0~20#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15239: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25282: havoc main_~node4__m4~97#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2561: havoc main_~node4__m4~10#1;havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11549: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~73#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~72#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25292: havoc main_~node4____CPAchecker_TMP_0~29#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13665: havoc main_~node3__m3~51#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~68#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~87#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23710: havoc main_~node1__m1~124#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~151#1;havoc main_~node4__m4~93#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~108#1;havoc main_~node1__m1~123#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~150#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2571: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17370: havoc main_~node1____CPAchecker_TMP_1~8#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L27414: havoc main_~node4__m4~105#1;havoc main_~node3__m3~102#1;havoc main_~node2__m2~120#1;havoc main_~node1__m1~151#1;havoc main_~__tmp_173~0#1, main_~assert__arg~172#1;havoc main_~check__tmp~178#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22657: havoc main_~node2____CPAchecker_TMP_1~8#1;havoc main_~node2__m2~104#1; [2025-03-03 15:07:39,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24774: havoc main_~node4__m4~96#1; [2025-03-03 15:07:39,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22134: havoc main_~node1____CPAchecker_TMP_1~19#1; [2025-03-03 15:07:39,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20549: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~131#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~93#1;havoc main_~node1__m1~105#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~130#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29005: havoc main_~node1__m1~163#1;havoc main_~__tmp_185~0#1, main_~assert__arg~184#1;havoc main_~check__tmp~190#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15267: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16856: havoc main_~node4__m4~64#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24784: havoc main_~node4____CPAchecker_TMP_0~28#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L26376: havoc main_~node1__m1~144#1;havoc main_~__tmp_166~0#1, main_~assert__arg~165#1;havoc main_~check__tmp~171#1;havoc main_~node4____CPAchecker_TMP_1~30#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14749: havoc main_~node1__m1~74#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~95#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~70#1;havoc main_~node1__m1~73#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~94#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4709: havoc main_~node4__m4~15#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21094: havoc main_~node4__m4~82#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~95#1;havoc main_~node1__m1~108#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~134#1;havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16866: havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L30083: havoc main_~node1____CPAchecker_TMP_1~33#1;havoc main_~node1__m1~171#1;havoc main_~__tmp_193~0#1, main_~assert__arg~192#1;havoc main_~check__tmp~198#1;havoc main_~node4__m4~116#1;havoc main_~node3__m3~110#1;havoc main_~node2__m2~130#1;havoc main_~node1__m1~170#1;havoc main_~__tmp_192~0#1, main_~assert__arg~191#1;havoc main_~check__tmp~197#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L25329: havoc main_~node1__m1~136#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~163#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8418: havoc main_~node2__m2~34#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~51#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17932: havoc main_~node1__m1~91#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~115#1;havoc main_~node4__m4~68#1;havoc main_~node3__m3~69#1;havoc main_~node2__m2~82#1;havoc main_~node1__m1~90#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~114#1; [2025-03-03 15:07:39,393 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23223: havoc main_~node1__m1~120#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~147#1;havoc main_~node4____CPAchecker_TMP_1~25#1; [2025-03-03 15:07:39,881 INFO L? ?]: Removed 3204 outVars from TransFormulas that were not future-live. [2025-03-03 15:07:39,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:07:39,946 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:07:39,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:07:39,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:39 BoogieIcfgContainer [2025-03-03 15:07:39,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:07:39,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:07:39,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:07:39,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:07:39,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:07:30" (1/3) ... [2025-03-03 15:07:39,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fea17c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:39, skipping insertion in model container [2025-03-03 15:07:39,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:32" (2/3) ... [2025-03-03 15:07:39,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fea17c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:39, skipping insertion in model container [2025-03-03 15:07:39,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:39" (3/3) ... [2025-03-03 15:07:39,960 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-03 15:07:39,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:07:39,974 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-03-03 15:07:40,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:07:40,088 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;@5a5a6d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:07:40,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-03 15:07:40,102 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-03-03 15:07:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:07:40,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:40,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:40,173 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-03-03 15:07:40,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1683600738, now seen corresponding path program 1 times [2025-03-03 15:07:40,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:40,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814802677] [2025-03-03 15:07:40,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:40,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:40,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:07:40,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:07:40,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:40,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:40,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814802677] [2025-03-03 15:07:40,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814802677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:40,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:40,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:40,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632550594] [2025-03-03 15:07:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:40,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:40,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:40,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:40,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:40,763 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-03-03 15:07:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:43,323 INFO L93 Difference]: Finished difference Result 6037 states and 10781 transitions. [2025-03-03 15:07:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:43,325 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-03-03 15:07:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:43,350 INFO L225 Difference]: With dead ends: 6037 [2025-03-03 15:07:43,350 INFO L226 Difference]: Without dead ends: 3573 [2025-03-03 15:07:43,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:43,361 INFO L435 NwaCegarLoop]: 2776 mSDtfsCounter, 17440 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17440 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:43,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17440 Valid, 3535 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 15:07:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-03-03 15:07:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3553. [2025-03-03 15:07:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3536 states have (on average 1.3498303167420815) internal successors, (4773), 3552 states have internal predecessors, (4773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4773 transitions. [2025-03-03 15:07:43,507 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4773 transitions. Word has length 64 [2025-03-03 15:07:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:43,507 INFO L471 AbstractCegarLoop]: Abstraction has 3553 states and 4773 transitions. [2025-03-03 15:07:43,507 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-03-03 15:07:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4773 transitions. [2025-03-03 15:07:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:07:43,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:43,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:43,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:07:43,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:07:43,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1746143536, now seen corresponding path program 1 times [2025-03-03 15:07:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:43,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221407701] [2025-03-03 15:07:43,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:43,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:43,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:07:43,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:07:43,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:43,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:43,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:43,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221407701] [2025-03-03 15:07:43,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221407701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:43,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:43,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:43,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160796113] [2025-03-03 15:07:43,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:43,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:43,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:43,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:43,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:43,779 INFO L87 Difference]: Start difference. First operand 3553 states and 4773 transitions. 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-03-03 15:07:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:45,814 INFO L93 Difference]: Finished difference Result 6951 states and 9367 transitions. [2025-03-03 15:07:45,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:45,814 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-03-03 15:07:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:45,831 INFO L225 Difference]: With dead ends: 6951 [2025-03-03 15:07:45,831 INFO L226 Difference]: Without dead ends: 4785 [2025-03-03 15:07:45,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:45,837 INFO L435 NwaCegarLoop]: 1448 mSDtfsCounter, 12425 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12425 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:45,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12425 Valid, 2212 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 15:07:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4785 states. [2025-03-03 15:07:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4785 to 4761. [2025-03-03 15:07:45,911 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-03-03 15:07:45,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6407 transitions. [2025-03-03 15:07:45,921 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6407 transitions. Word has length 64 [2025-03-03 15:07:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:45,922 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6407 transitions. [2025-03-03 15:07:45,922 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-03-03 15:07:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6407 transitions. [2025-03-03 15:07:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:07:45,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:45,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:45,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:07:45,928 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-03-03 15:07:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash -149589741, now seen corresponding path program 1 times [2025-03-03 15:07:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:45,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515793623] [2025-03-03 15:07:45,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:45,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:07:45,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:07:45,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:45,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:46,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:46,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515793623] [2025-03-03 15:07:46,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515793623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:46,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:46,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:46,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438469891] [2025-03-03 15:07:46,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:46,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:46,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:46,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:46,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:46,100 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-03-03 15:07:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:47,408 INFO L93 Difference]: Finished difference Result 9743 states and 13157 transitions. [2025-03-03 15:07:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:47,408 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-03-03 15:07:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:47,426 INFO L225 Difference]: With dead ends: 9743 [2025-03-03 15:07:47,426 INFO L226 Difference]: Without dead ends: 6636 [2025-03-03 15:07:47,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:47,431 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 10937 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:47,431 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.2s Time] [2025-03-03 15:07:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2025-03-03 15:07:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 6609. [2025-03-03 15:07:47,539 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-03-03 15:07:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 8950 transitions. [2025-03-03 15:07:47,552 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 8950 transitions. Word has length 65 [2025-03-03 15:07:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:47,552 INFO L471 AbstractCegarLoop]: Abstraction has 6609 states and 8950 transitions. [2025-03-03 15:07:47,552 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-03-03 15:07:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 8950 transitions. [2025-03-03 15:07:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:07:47,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:47,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:47,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:07:47,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:07:47,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1553251035, now seen corresponding path program 1 times [2025-03-03 15:07:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:47,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34271404] [2025-03-03 15:07:47,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:47,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:07:47,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:07:47,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:47,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:48,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34271404] [2025-03-03 15:07:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34271404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:48,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:48,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:07:48,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674554571] [2025-03-03 15:07:48,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:48,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:07:48,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:48,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:07:48,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:07:48,099 INFO L87 Difference]: Start difference. First operand 6609 states and 8950 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-03-03 15:07:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:50,505 INFO L93 Difference]: Finished difference Result 8361 states and 11458 transitions. [2025-03-03 15:07:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:50,505 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-03-03 15:07:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:50,524 INFO L225 Difference]: With dead ends: 8361 [2025-03-03 15:07:50,524 INFO L226 Difference]: Without dead ends: 7594 [2025-03-03 15:07:50,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:07:50,530 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 12918 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 5978 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12918 SdHoareTripleChecker+Valid, 6387 SdHoareTripleChecker+Invalid, 5997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:50,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12918 Valid, 6387 Invalid, 5997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5978 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 15:07:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2025-03-03 15:07:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6536. [2025-03-03 15:07:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6536 states, 6519 states have (on average 1.3564963951526308) internal successors, (8843), 6535 states have internal predecessors, (8843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 8843 transitions. [2025-03-03 15:07:50,668 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 8843 transitions. Word has length 66 [2025-03-03 15:07:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:50,669 INFO L471 AbstractCegarLoop]: Abstraction has 6536 states and 8843 transitions. [2025-03-03 15:07:50,669 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-03-03 15:07:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 8843 transitions. [2025-03-03 15:07:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:07:50,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:50,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:50,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:07:50,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:07:50,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1524288963, now seen corresponding path program 1 times [2025-03-03 15:07:50,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:50,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436375967] [2025-03-03 15:07:50,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:50,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:50,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:07:50,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:07:50,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:50,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:50,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:50,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436375967] [2025-03-03 15:07:50,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436375967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:50,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:50,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:50,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294985359] [2025-03-03 15:07:50,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:50,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:50,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:50,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:50,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:50,817 INFO L87 Difference]: Start difference. First operand 6536 states and 8843 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-03-03 15:07:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:51,855 INFO L93 Difference]: Finished difference Result 12758 states and 17451 transitions. [2025-03-03 15:07:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:51,855 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-03-03 15:07:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:51,873 INFO L225 Difference]: With dead ends: 12758 [2025-03-03 15:07:51,873 INFO L226 Difference]: Without dead ends: 8364 [2025-03-03 15:07:51,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:51,879 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 9338 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9338 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:51,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9338 Valid, 1841 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:07:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2025-03-03 15:07:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 8329. [2025-03-03 15:07:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8329 states, 8312 states have (on average 1.3731953801732435) internal successors, (11414), 8328 states have internal predecessors, (11414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 11414 transitions. [2025-03-03 15:07:51,985 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 11414 transitions. Word has length 66 [2025-03-03 15:07:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:51,986 INFO L471 AbstractCegarLoop]: Abstraction has 8329 states and 11414 transitions. [2025-03-03 15:07:51,986 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-03-03 15:07:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 11414 transitions. [2025-03-03 15:07:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:07:51,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:51,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:51,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:07:51,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:07:51,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 594487283, now seen corresponding path program 1 times [2025-03-03 15:07:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080467829] [2025-03-03 15:07:51,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:52,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:07:52,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:07:52,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:52,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080467829] [2025-03-03 15:07:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080467829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:52,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:52,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:52,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84514484] [2025-03-03 15:07:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:52,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:52,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:52,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:52,393 INFO L87 Difference]: Start difference. First operand 8329 states and 11414 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-03-03 15:07:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:54,887 INFO L93 Difference]: Finished difference Result 14195 states and 19819 transitions. [2025-03-03 15:07:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:54,887 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-03-03 15:07:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:54,907 INFO L225 Difference]: With dead ends: 14195 [2025-03-03 15:07:54,907 INFO L226 Difference]: Without dead ends: 12836 [2025-03-03 15:07:54,912 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-03-03 15:07:54,912 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 14844 mSDsluCounter, 4487 mSDsCounter, 0 mSdLazyCounter, 6616 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14844 SdHoareTripleChecker+Valid, 5836 SdHoareTripleChecker+Invalid, 6748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 6616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:54,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14844 Valid, 5836 Invalid, 6748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 6616 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 15:07:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12836 states. [2025-03-03 15:07:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12836 to 8272. [2025-03-03 15:07:55,025 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-03-03 15:07:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8272 states to 8272 states and 11332 transitions. [2025-03-03 15:07:55,037 INFO L78 Accepts]: Start accepts. Automaton has 8272 states and 11332 transitions. Word has length 66 [2025-03-03 15:07:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:55,037 INFO L471 AbstractCegarLoop]: Abstraction has 8272 states and 11332 transitions. [2025-03-03 15:07:55,037 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-03-03 15:07:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8272 states and 11332 transitions. [2025-03-03 15:07:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:07:55,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:55,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:55,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:07:55,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:07:55,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1942931662, now seen corresponding path program 1 times [2025-03-03 15:07:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:55,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064282019] [2025-03-03 15:07:55,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:55,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:55,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:07:55,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:07:55,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:55,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:55,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:55,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064282019] [2025-03-03 15:07:55,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064282019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:55,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:55,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:07:55,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873877166] [2025-03-03 15:07:55,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:55,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:07:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:55,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:07:55,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:07:55,747 INFO L87 Difference]: Start difference. First operand 8272 states and 11332 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-03-03 15:07:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:57,301 INFO L93 Difference]: Finished difference Result 13386 states and 18711 transitions. [2025-03-03 15:07:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:07:57,301 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-03-03 15:07:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:57,321 INFO L225 Difference]: With dead ends: 13386 [2025-03-03 15:07:57,321 INFO L226 Difference]: Without dead ends: 13382 [2025-03-03 15:07:57,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:07:57,326 INFO L435 NwaCegarLoop]: 2368 mSDtfsCounter, 19669 mSDsluCounter, 13481 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19669 SdHoareTripleChecker+Valid, 15849 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:57,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19669 Valid, 15849 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:07:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2025-03-03 15:07:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 8268. [2025-03-03 15:07:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8268 states, 8252 states have (on average 1.3727581192438196) internal successors, (11328), 8267 states have internal predecessors, (11328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 11328 transitions. [2025-03-03 15:07:57,474 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 11328 transitions. Word has length 67 [2025-03-03 15:07:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:57,475 INFO L471 AbstractCegarLoop]: Abstraction has 8268 states and 11328 transitions. [2025-03-03 15:07:57,475 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-03-03 15:07:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 11328 transitions. [2025-03-03 15:07:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:07:57,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:57,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:57,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:07:57,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:07:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -527750684, now seen corresponding path program 1 times [2025-03-03 15:07:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079880069] [2025-03-03 15:07:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:57,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:07:57,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:07:57,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:57,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079880069] [2025-03-03 15:07:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079880069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:57,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339162662] [2025-03-03 15:07:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:57,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:57,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:57,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:57,760 INFO L87 Difference]: Start difference. First operand 8268 states and 11328 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-03-03 15:08:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,363 INFO L93 Difference]: Finished difference Result 11829 states and 16316 transitions. [2025-03-03 15:08:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:00,363 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-03-03 15:08:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,377 INFO L225 Difference]: With dead ends: 11829 [2025-03-03 15:08:00,378 INFO L226 Difference]: Without dead ends: 11821 [2025-03-03 15:08:00,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:00,381 INFO L435 NwaCegarLoop]: 1420 mSDtfsCounter, 11673 mSDsluCounter, 5620 mSDsCounter, 0 mSdLazyCounter, 6950 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11673 SdHoareTripleChecker+Valid, 7040 SdHoareTripleChecker+Invalid, 7008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 6950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11673 Valid, 7040 Invalid, 7008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 6950 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 15:08:00,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2025-03-03 15:08:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 8268. [2025-03-03 15:08:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8268 states, 8252 states have (on average 1.3726369365002424) internal successors, (11327), 8267 states have internal predecessors, (11327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 11327 transitions. [2025-03-03 15:08:00,507 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 11327 transitions. Word has length 67 [2025-03-03 15:08:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,508 INFO L471 AbstractCegarLoop]: Abstraction has 8268 states and 11327 transitions. [2025-03-03 15:08:00,508 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-03-03 15:08:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 11327 transitions. [2025-03-03 15:08:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:00,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:08:00,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:00,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash 921697053, now seen corresponding path program 1 times [2025-03-03 15:08:00,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390358502] [2025-03-03 15:08:00,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:00,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:00,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390358502] [2025-03-03 15:08:00,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390358502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:00,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944065234] [2025-03-03 15:08:00,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:00,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:00,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:00,769 INFO L87 Difference]: Start difference. First operand 8268 states and 11327 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-03-03 15:08:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:02,967 INFO L93 Difference]: Finished difference Result 9708 states and 13338 transitions. [2025-03-03 15:08:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:02,967 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-03-03 15:08:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:02,979 INFO L225 Difference]: With dead ends: 9708 [2025-03-03 15:08:02,979 INFO L226 Difference]: Without dead ends: 9703 [2025-03-03 15:08:02,983 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-03-03 15:08:02,986 INFO L435 NwaCegarLoop]: 1372 mSDtfsCounter, 13086 mSDsluCounter, 4408 mSDsCounter, 0 mSdLazyCounter, 5174 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13086 SdHoareTripleChecker+Valid, 5780 SdHoareTripleChecker+Invalid, 5198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:02,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13086 Valid, 5780 Invalid, 5198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5174 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 15:08:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9703 states. [2025-03-03 15:08:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9703 to 8268. [2025-03-03 15:08:03,088 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-03-03 15:08:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8268 states to 8268 states and 11326 transitions. [2025-03-03 15:08:03,098 INFO L78 Accepts]: Start accepts. Automaton has 8268 states and 11326 transitions. Word has length 67 [2025-03-03 15:08:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:03,098 INFO L471 AbstractCegarLoop]: Abstraction has 8268 states and 11326 transitions. [2025-03-03 15:08:03,098 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-03-03 15:08:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8268 states and 11326 transitions. [2025-03-03 15:08:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:08:03,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:03,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:03,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:08:03,104 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1753741310, now seen corresponding path program 1 times [2025-03-03 15:08:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688312654] [2025-03-03 15:08:03,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:03,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:08:03,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:08:03,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:03,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:03,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:03,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688312654] [2025-03-03 15:08:03,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688312654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:03,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:03,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:08:03,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368016442] [2025-03-03 15:08:03,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:03,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:03,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:03,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:03,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:03,575 INFO L87 Difference]: Start difference. First operand 8268 states and 11326 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-03-03 15:08:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:05,183 INFO L93 Difference]: Finished difference Result 13374 states and 18698 transitions. [2025-03-03 15:08:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:08:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-03-03 15:08:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:05,200 INFO L225 Difference]: With dead ends: 13374 [2025-03-03 15:08:05,201 INFO L226 Difference]: Without dead ends: 13370 [2025-03-03 15:08:05,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:05,207 INFO L435 NwaCegarLoop]: 2367 mSDtfsCounter, 17006 mSDsluCounter, 16437 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17006 SdHoareTripleChecker+Valid, 18804 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:05,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17006 Valid, 18804 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:08:05,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13370 states. [2025-03-03 15:08:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13370 to 8264. [2025-03-03 15:08:05,317 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-03-03 15:08:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 11322 transitions. [2025-03-03 15:08:05,327 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 11322 transitions. Word has length 67 [2025-03-03 15:08:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:05,328 INFO L471 AbstractCegarLoop]: Abstraction has 8264 states and 11322 transitions. [2025-03-03 15:08:05,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-03-03 15:08:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 11322 transitions. [2025-03-03 15:08:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:05,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:05,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:05,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:08:05,333 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-03-03 15:08:05,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:05,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1664414035, now seen corresponding path program 1 times [2025-03-03 15:08:05,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:05,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540924800] [2025-03-03 15:08:05,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:05,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:05,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:05,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:05,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:05,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:05,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:05,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540924800] [2025-03-03 15:08:05,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540924800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:05,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:05,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:05,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672219503] [2025-03-03 15:08:05,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:05,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:05,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:05,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:05,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:05,802 INFO L87 Difference]: Start difference. First operand 8264 states and 11322 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-03-03 15:08:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:08,901 INFO L93 Difference]: Finished difference Result 19007 states and 26821 transitions. [2025-03-03 15:08:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 15:08:08,901 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-03-03 15:08:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:08,920 INFO L225 Difference]: With dead ends: 19007 [2025-03-03 15:08:08,921 INFO L226 Difference]: Without dead ends: 18996 [2025-03-03 15:08:08,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:08:08,927 INFO L435 NwaCegarLoop]: 2283 mSDtfsCounter, 15602 mSDsluCounter, 17310 mSDsCounter, 0 mSdLazyCounter, 5702 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15602 SdHoareTripleChecker+Valid, 19593 SdHoareTripleChecker+Invalid, 5822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 5702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:08,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15602 Valid, 19593 Invalid, 5822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 5702 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 15:08:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18996 states. [2025-03-03 15:08:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18996 to 8258. [2025-03-03 15:08:09,055 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-03-03 15:08:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 11315 transitions. [2025-03-03 15:08:09,064 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 11315 transitions. Word has length 68 [2025-03-03 15:08:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:09,064 INFO L471 AbstractCegarLoop]: Abstraction has 8258 states and 11315 transitions. [2025-03-03 15:08:09,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-03-03 15:08:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 11315 transitions. [2025-03-03 15:08:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:09,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:09,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:09,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:08:09,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:09,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1709809074, now seen corresponding path program 1 times [2025-03-03 15:08:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:09,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942317268] [2025-03-03 15:08:09,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:09,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:09,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:09,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:09,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:09,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942317268] [2025-03-03 15:08:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942317268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:09,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:09,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:08:09,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124970474] [2025-03-03 15:08:09,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:09,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:08:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:09,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:08:09,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:08:09,281 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-03-03 15:08:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,261 INFO L93 Difference]: Finished difference Result 11502 states and 16008 transitions. [2025-03-03 15:08:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:08:11,261 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-03-03 15:08:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,271 INFO L225 Difference]: With dead ends: 11502 [2025-03-03 15:08:11,271 INFO L226 Difference]: Without dead ends: 9921 [2025-03-03 15:08:11,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:11,274 INFO L435 NwaCegarLoop]: 1338 mSDtfsCounter, 11155 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 5208 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11155 Valid, 5876 Invalid, 5223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 5208 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 15:08:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9921 states. [2025-03-03 15:08:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9921 to 8258. [2025-03-03 15:08:11,356 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-03-03 15:08:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 11314 transitions. [2025-03-03 15:08:11,366 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 11314 transitions. Word has length 68 [2025-03-03 15:08:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,366 INFO L471 AbstractCegarLoop]: Abstraction has 8258 states and 11314 transitions. [2025-03-03 15:08:11,366 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-03-03 15:08:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 11314 transitions. [2025-03-03 15:08:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:11,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:11,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:08:11,372 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:11,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1265022055, now seen corresponding path program 1 times [2025-03-03 15:08:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929840964] [2025-03-03 15:08:11,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:11,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:11,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929840964] [2025-03-03 15:08:11,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929840964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:11,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061691757] [2025-03-03 15:08:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:11,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:11,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:11,567 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-03-03 15:08:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:14,335 INFO L93 Difference]: Finished difference Result 13890 states and 19416 transitions. [2025-03-03 15:08:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:14,336 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-03-03 15:08:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:14,347 INFO L225 Difference]: With dead ends: 13890 [2025-03-03 15:08:14,347 INFO L226 Difference]: Without dead ends: 12531 [2025-03-03 15:08:14,351 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-03-03 15:08:14,351 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 14180 mSDsluCounter, 4496 mSDsCounter, 0 mSdLazyCounter, 6653 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14180 SdHoareTripleChecker+Valid, 5852 SdHoareTripleChecker+Invalid, 6781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 6653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:14,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14180 Valid, 5852 Invalid, 6781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 6653 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 15:08:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2025-03-03 15:08:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 8258. [2025-03-03 15:08:14,432 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-03-03 15:08:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 11313 transitions. [2025-03-03 15:08:14,440 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 11313 transitions. Word has length 68 [2025-03-03 15:08:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:14,440 INFO L471 AbstractCegarLoop]: Abstraction has 8258 states and 11313 transitions. [2025-03-03 15:08:14,440 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-03-03 15:08:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 11313 transitions. [2025-03-03 15:08:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:14,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:14,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:14,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:08:14,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:14,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1446008360, now seen corresponding path program 1 times [2025-03-03 15:08:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:14,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463038767] [2025-03-03 15:08:14,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:14,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:14,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:14,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:14,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:14,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:14,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463038767] [2025-03-03 15:08:14,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463038767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:14,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:14,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:14,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96752508] [2025-03-03 15:08:14,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:14,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:14,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:14,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:14,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:14,636 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-03-03 15:08:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:17,103 INFO L93 Difference]: Finished difference Result 13128 states and 18338 transitions. [2025-03-03 15:08:17,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:17,103 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-03-03 15:08:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:17,115 INFO L225 Difference]: With dead ends: 13128 [2025-03-03 15:08:17,115 INFO L226 Difference]: Without dead ends: 11811 [2025-03-03 15:08:17,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:17,119 INFO L435 NwaCegarLoop]: 1449 mSDtfsCounter, 11570 mSDsluCounter, 5697 mSDsCounter, 0 mSdLazyCounter, 6980 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11570 SdHoareTripleChecker+Valid, 7146 SdHoareTripleChecker+Invalid, 7038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 6980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:17,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11570 Valid, 7146 Invalid, 7038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 6980 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 15:08:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11811 states. [2025-03-03 15:08:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11811 to 8258. [2025-03-03 15:08:17,223 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-03-03 15:08:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 11312 transitions. [2025-03-03 15:08:17,233 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 11312 transitions. Word has length 68 [2025-03-03 15:08:17,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:17,233 INFO L471 AbstractCegarLoop]: Abstraction has 8258 states and 11312 transitions. [2025-03-03 15:08:17,233 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-03-03 15:08:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 11312 transitions. [2025-03-03 15:08:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:17,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:17,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:17,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:08:17,239 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-03-03 15:08:17,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1807945282, now seen corresponding path program 1 times [2025-03-03 15:08:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:17,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242221322] [2025-03-03 15:08:17,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:17,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:17,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:17,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:17,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:17,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:17,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242221322] [2025-03-03 15:08:17,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242221322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:17,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:17,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782985325] [2025-03-03 15:08:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:17,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:17,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:17,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:17,621 INFO L87 Difference]: Start difference. First operand 8258 states and 11312 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-03-03 15:08:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:20,222 INFO L93 Difference]: Finished difference Result 19783 states and 28146 transitions. [2025-03-03 15:08:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 15:08:20,222 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-03-03 15:08:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:20,241 INFO L225 Difference]: With dead ends: 19783 [2025-03-03 15:08:20,241 INFO L226 Difference]: Without dead ends: 18265 [2025-03-03 15:08:20,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=765, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:08:20,248 INFO L435 NwaCegarLoop]: 2329 mSDtfsCounter, 22014 mSDsluCounter, 13046 mSDsCounter, 0 mSdLazyCounter, 4585 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22014 SdHoareTripleChecker+Valid, 15375 SdHoareTripleChecker+Invalid, 4692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 4585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:20,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22014 Valid, 15375 Invalid, 4692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 4585 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 15:08:20,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18265 states. [2025-03-03 15:08:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18265 to 8038. [2025-03-03 15:08:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8038 states, 8024 states have (on average 1.369765702891326) internal successors, (10991), 8037 states have internal predecessors, (10991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8038 states to 8038 states and 10991 transitions. [2025-03-03 15:08:20,372 INFO L78 Accepts]: Start accepts. Automaton has 8038 states and 10991 transitions. Word has length 68 [2025-03-03 15:08:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,372 INFO L471 AbstractCegarLoop]: Abstraction has 8038 states and 10991 transitions. [2025-03-03 15:08:20,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-03-03 15:08:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 8038 states and 10991 transitions. [2025-03-03 15:08:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:08:20,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:08:20,377 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-03-03 15:08:20,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:20,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1031126213, now seen corresponding path program 1 times [2025-03-03 15:08:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151010888] [2025-03-03 15:08:20,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:20,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:08:20,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:08:20,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:20,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:20,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151010888] [2025-03-03 15:08:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151010888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063864532] [2025-03-03 15:08:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:20,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:20,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:20,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:20,456 INFO L87 Difference]: Start difference. First operand 8038 states and 10991 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-03-03 15:08:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:20,567 INFO L93 Difference]: Finished difference Result 11794 states and 16409 transitions. [2025-03-03 15:08:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:20,567 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-03-03 15:08:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:20,575 INFO L225 Difference]: With dead ends: 11794 [2025-03-03 15:08:20,575 INFO L226 Difference]: Without dead ends: 7115 [2025-03-03 15:08:20,581 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-03-03 15:08:20,581 INFO L435 NwaCegarLoop]: 1981 mSDtfsCounter, 1932 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:20,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1932 Valid, 2612 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2025-03-03 15:08:20,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7097. [2025-03-03 15:08:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7097 states, 7087 states have (on average 1.383942429801044) internal successors, (9808), 7096 states have internal predecessors, (9808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7097 states to 7097 states and 9808 transitions. [2025-03-03 15:08:20,650 INFO L78 Accepts]: Start accepts. Automaton has 7097 states and 9808 transitions. Word has length 68 [2025-03-03 15:08:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,650 INFO L471 AbstractCegarLoop]: Abstraction has 7097 states and 9808 transitions. [2025-03-03 15:08:20,650 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-03-03 15:08:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 7097 states and 9808 transitions. [2025-03-03 15:08:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:20,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:08:20,655 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-03-03 15:08:20,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -736185921, now seen corresponding path program 1 times [2025-03-03 15:08:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:20,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732032190] [2025-03-03 15:08:20,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:20,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:20,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:20,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:20,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:20,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732032190] [2025-03-03 15:08:20,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732032190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:20,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:20,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671787034] [2025-03-03 15:08:20,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:20,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:20,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:20,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:20,714 INFO L87 Difference]: Start difference. First operand 7097 states and 9808 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-03-03 15:08:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:20,846 INFO L93 Difference]: Finished difference Result 11417 states and 16075 transitions. [2025-03-03 15:08:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:20,847 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-03-03 15:08:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:20,852 INFO L225 Difference]: With dead ends: 11417 [2025-03-03 15:08:20,853 INFO L226 Difference]: Without dead ends: 6941 [2025-03-03 15:08:20,857 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-03-03 15:08:20,857 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 1552 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:20,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 2054 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6941 states. [2025-03-03 15:08:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6941 to 6933. [2025-03-03 15:08:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6933 states, 6926 states have (on average 1.4042737510828762) internal successors, (9726), 6932 states have internal predecessors, (9726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 9726 transitions. [2025-03-03 15:08:20,909 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 9726 transitions. Word has length 69 [2025-03-03 15:08:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:20,910 INFO L471 AbstractCegarLoop]: Abstraction has 6933 states and 9726 transitions. [2025-03-03 15:08:20,910 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-03-03 15:08:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 9726 transitions. [2025-03-03 15:08:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:20,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:20,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:20,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:08:20,912 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:20,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2071787563, now seen corresponding path program 1 times [2025-03-03 15:08:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:20,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218641865] [2025-03-03 15:08:20,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:20,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:20,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:20,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:20,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:20,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:20,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218641865] [2025-03-03 15:08:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218641865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:20,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:20,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:20,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901772863] [2025-03-03 15:08:20,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:20,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:20,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:20,961 INFO L87 Difference]: Start difference. First operand 6933 states and 9726 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-03-03 15:08:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,069 INFO L93 Difference]: Finished difference Result 14690 states and 21068 transitions. [2025-03-03 15:08:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:21,069 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-03-03 15:08:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,077 INFO L225 Difference]: With dead ends: 14690 [2025-03-03 15:08:21,077 INFO L226 Difference]: Without dead ends: 10483 [2025-03-03 15:08:21,081 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-03-03 15:08:21,081 INFO L435 NwaCegarLoop]: 1790 mSDtfsCounter, 888 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:21,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 3010 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10483 states. [2025-03-03 15:08:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10483 to 10475. [2025-03-03 15:08:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10475 states, 10468 states have (on average 1.3991211310661062) internal successors, (14646), 10474 states have internal predecessors, (14646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 14646 transitions. [2025-03-03 15:08:21,168 INFO L78 Accepts]: Start accepts. Automaton has 10475 states and 14646 transitions. Word has length 69 [2025-03-03 15:08:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,168 INFO L471 AbstractCegarLoop]: Abstraction has 10475 states and 14646 transitions. [2025-03-03 15:08:21,168 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-03-03 15:08:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 10475 states and 14646 transitions. [2025-03-03 15:08:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:21,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:21,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:08:21,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:21,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1024659053, now seen corresponding path program 1 times [2025-03-03 15:08:21,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940719940] [2025-03-03 15:08:21,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:21,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:21,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:21,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:21,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940719940] [2025-03-03 15:08:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940719940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:21,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201481465] [2025-03-03 15:08:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:21,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:21,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:21,226 INFO L87 Difference]: Start difference. First operand 10475 states and 14646 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-03-03 15:08:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,328 INFO L93 Difference]: Finished difference Result 23078 states and 33143 transitions. [2025-03-03 15:08:21,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:21,329 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-03-03 15:08:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,346 INFO L225 Difference]: With dead ends: 23078 [2025-03-03 15:08:21,347 INFO L226 Difference]: Without dead ends: 16665 [2025-03-03 15:08:21,356 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-03-03 15:08:21,356 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 981 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 3002 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-03-03 15:08:21,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 3002 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2025-03-03 15:08:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16657. [2025-03-03 15:08:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16657 states, 16650 states have (on average 1.4091891891891892) internal successors, (23463), 16656 states have internal predecessors, (23463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16657 states to 16657 states and 23463 transitions. [2025-03-03 15:08:21,583 INFO L78 Accepts]: Start accepts. Automaton has 16657 states and 23463 transitions. Word has length 69 [2025-03-03 15:08:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,583 INFO L471 AbstractCegarLoop]: Abstraction has 16657 states and 23463 transitions. [2025-03-03 15:08:21,583 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-03-03 15:08:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 16657 states and 23463 transitions. [2025-03-03 15:08:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:08:21,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:21,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:08:21,587 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:21,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,588 INFO L85 PathProgramCache]: Analyzing trace with hash 714340209, now seen corresponding path program 1 times [2025-03-03 15:08:21,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195898774] [2025-03-03 15:08:21,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:08:21,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:08:21,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:21,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:21,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195898774] [2025-03-03 15:08:21,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195898774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:21,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:21,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668942597] [2025-03-03 15:08:21,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:21,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:21,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:21,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:21,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:21,643 INFO L87 Difference]: Start difference. First operand 16657 states and 23463 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-03-03 15:08:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,731 INFO L93 Difference]: Finished difference Result 31659 states and 46284 transitions. [2025-03-03 15:08:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:21,732 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-03-03 15:08:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,752 INFO L225 Difference]: With dead ends: 31659 [2025-03-03 15:08:21,752 INFO L226 Difference]: Without dead ends: 21048 [2025-03-03 15:08:21,766 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-03-03 15:08:21,767 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 939 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:21,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2355 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21048 states. [2025-03-03 15:08:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21048 to 17058. [2025-03-03 15:08:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17058 states, 17051 states have (on average 1.4309424667174946) internal successors, (24399), 17057 states have internal predecessors, (24399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17058 states to 17058 states and 24399 transitions. [2025-03-03 15:08:21,943 INFO L78 Accepts]: Start accepts. Automaton has 17058 states and 24399 transitions. Word has length 69 [2025-03-03 15:08:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,943 INFO L471 AbstractCegarLoop]: Abstraction has 17058 states and 24399 transitions. [2025-03-03 15:08:21,943 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-03-03 15:08:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 17058 states and 24399 transitions. [2025-03-03 15:08:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:21,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,947 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:21,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:08:21,948 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:21,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,948 INFO L85 PathProgramCache]: Analyzing trace with hash -961374250, now seen corresponding path program 1 times [2025-03-03 15:08:21,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640155168] [2025-03-03 15:08:21,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:21,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:21,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:21,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:21,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640155168] [2025-03-03 15:08:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640155168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488637685] [2025-03-03 15:08:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:21,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:21,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:21,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:21,992 INFO L87 Difference]: Start difference. First operand 17058 states and 24399 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-03-03 15:08:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:22,151 INFO L93 Difference]: Finished difference Result 33909 states and 49192 transitions. [2025-03-03 15:08:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:22,152 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-03-03 15:08:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:22,169 INFO L225 Difference]: With dead ends: 33909 [2025-03-03 15:08:22,169 INFO L226 Difference]: Without dead ends: 18462 [2025-03-03 15:08:22,181 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-03-03 15:08:22,182 INFO L435 NwaCegarLoop]: 1363 mSDtfsCounter, 1106 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:22,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 1937 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18462 states. [2025-03-03 15:08:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18462 to 15153. [2025-03-03 15:08:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15153 states, 15146 states have (on average 1.4454641489502178) internal successors, (21893), 15152 states have internal predecessors, (21893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15153 states to 15153 states and 21893 transitions. [2025-03-03 15:08:22,322 INFO L78 Accepts]: Start accepts. Automaton has 15153 states and 21893 transitions. Word has length 70 [2025-03-03 15:08:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:22,322 INFO L471 AbstractCegarLoop]: Abstraction has 15153 states and 21893 transitions. [2025-03-03 15:08:22,323 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-03-03 15:08:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 15153 states and 21893 transitions. [2025-03-03 15:08:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:08:22,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:22,326 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:22,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:08:22,326 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:22,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash -988507150, now seen corresponding path program 1 times [2025-03-03 15:08:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:22,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551309652] [2025-03-03 15:08:22,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:22,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:08:22,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:08:22,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:22,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551309652] [2025-03-03 15:08:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551309652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:22,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810969378] [2025-03-03 15:08:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:22,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:22,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:22,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:22,372 INFO L87 Difference]: Start difference. First operand 15153 states and 21893 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-03-03 15:08:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:22,548 INFO L93 Difference]: Finished difference Result 30843 states and 45208 transitions. [2025-03-03 15:08:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:22,549 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-03-03 15:08:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:22,563 INFO L225 Difference]: With dead ends: 30843 [2025-03-03 15:08:22,563 INFO L226 Difference]: Without dead ends: 17035 [2025-03-03 15:08:22,569 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-03-03 15:08:22,570 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1277 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:22,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1907 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17035 states. [2025-03-03 15:08:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17035 to 13656. [2025-03-03 15:08:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13656 states, 13649 states have (on average 1.4634039123745328) internal successors, (19974), 13655 states have internal predecessors, (19974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13656 states to 13656 states and 19974 transitions. [2025-03-03 15:08:22,697 INFO L78 Accepts]: Start accepts. Automaton has 13656 states and 19974 transitions. Word has length 70 [2025-03-03 15:08:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:22,697 INFO L471 AbstractCegarLoop]: Abstraction has 13656 states and 19974 transitions. [2025-03-03 15:08:22,697 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-03-03 15:08:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 13656 states and 19974 transitions. [2025-03-03 15:08:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:22,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:22,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:22,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:08:22,699 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:22,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash -313586770, now seen corresponding path program 1 times [2025-03-03 15:08:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:22,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359248892] [2025-03-03 15:08:22,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:22,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:22,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:22,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:22,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:23,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:23,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359248892] [2025-03-03 15:08:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359248892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:23,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:23,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:08:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827924211] [2025-03-03 15:08:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:23,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:23,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:23,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:23,004 INFO L87 Difference]: Start difference. First operand 13656 states and 19974 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 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-03-03 15:08:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:24,588 INFO L93 Difference]: Finished difference Result 39775 states and 58201 transitions. [2025-03-03 15:08:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 15:08:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 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-03-03 15:08:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:24,631 INFO L225 Difference]: With dead ends: 39775 [2025-03-03 15:08:24,631 INFO L226 Difference]: Without dead ends: 39380 [2025-03-03 15:08:24,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:08:24,643 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 13073 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13073 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 2981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:24,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13073 Valid, 3046 Invalid, 2981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:08:24,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39380 states. [2025-03-03 15:08:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39380 to 13660. [2025-03-03 15:08:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13660 states, 13653 states have (on average 1.4632681461949755) internal successors, (19978), 13659 states have internal predecessors, (19978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13660 states to 13660 states and 19978 transitions. [2025-03-03 15:08:24,966 INFO L78 Accepts]: Start accepts. Automaton has 13660 states and 19978 transitions. Word has length 71 [2025-03-03 15:08:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:24,967 INFO L471 AbstractCegarLoop]: Abstraction has 13660 states and 19978 transitions. [2025-03-03 15:08:24,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 11 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-03-03 15:08:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13660 states and 19978 transitions. [2025-03-03 15:08:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:24,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:24,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:24,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:08:24,969 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:24,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash 276301186, now seen corresponding path program 1 times [2025-03-03 15:08:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:24,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85451912] [2025-03-03 15:08:24,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:24,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:25,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:25,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:25,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:25,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85451912] [2025-03-03 15:08:25,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85451912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:25,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:25,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4970747] [2025-03-03 15:08:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:25,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:25,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:25,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:25,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:25,191 INFO L87 Difference]: Start difference. First operand 13660 states and 19978 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-03-03 15:08:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:26,404 INFO L93 Difference]: Finished difference Result 32184 states and 47451 transitions. [2025-03-03 15:08:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:08:26,405 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-03-03 15:08:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:26,437 INFO L225 Difference]: With dead ends: 32184 [2025-03-03 15:08:26,437 INFO L226 Difference]: Without dead ends: 31770 [2025-03-03 15:08:26,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:08:26,448 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 4734 mSDsluCounter, 2915 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 3678 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:26,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 3678 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:08:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31770 states. [2025-03-03 15:08:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31770 to 13660. [2025-03-03 15:08:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13660 states, 13653 states have (on average 1.4631949022192925) internal successors, (19977), 13659 states have internal predecessors, (19977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:26,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13660 states to 13660 states and 19977 transitions. [2025-03-03 15:08:26,641 INFO L78 Accepts]: Start accepts. Automaton has 13660 states and 19977 transitions. Word has length 71 [2025-03-03 15:08:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:26,641 INFO L471 AbstractCegarLoop]: Abstraction has 13660 states and 19977 transitions. [2025-03-03 15:08:26,641 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-03-03 15:08:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 13660 states and 19977 transitions. [2025-03-03 15:08:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:26,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:26,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:26,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:08:26,643 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:26,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:26,643 INFO L85 PathProgramCache]: Analyzing trace with hash -923233080, now seen corresponding path program 1 times [2025-03-03 15:08:26,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:26,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698665323] [2025-03-03 15:08:26,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:26,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:26,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:26,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:26,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:26,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:26,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698665323] [2025-03-03 15:08:26,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698665323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:26,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:26,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:26,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980104292] [2025-03-03 15:08:26,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:26,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:26,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:26,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:26,837 INFO L87 Difference]: Start difference. First operand 13660 states and 19977 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-03-03 15:08:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:27,822 INFO L93 Difference]: Finished difference Result 17621 states and 25625 transitions. [2025-03-03 15:08:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:27,823 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-03-03 15:08:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:27,841 INFO L225 Difference]: With dead ends: 17621 [2025-03-03 15:08:27,841 INFO L226 Difference]: Without dead ends: 17226 [2025-03-03 15:08:27,847 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-03-03 15:08:27,847 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 6938 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 2680 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6938 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:27,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6938 Valid, 3266 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2680 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:08:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17226 states. [2025-03-03 15:08:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17226 to 13660. [2025-03-03 15:08:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13660 states, 13653 states have (on average 1.4631216582436095) internal successors, (19976), 13659 states have internal predecessors, (19976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13660 states to 13660 states and 19976 transitions. [2025-03-03 15:08:27,994 INFO L78 Accepts]: Start accepts. Automaton has 13660 states and 19976 transitions. Word has length 71 [2025-03-03 15:08:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:27,995 INFO L471 AbstractCegarLoop]: Abstraction has 13660 states and 19976 transitions. [2025-03-03 15:08:27,995 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-03-03 15:08:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 13660 states and 19976 transitions. [2025-03-03 15:08:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:27,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:27,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:27,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:08:27,997 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:27,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:27,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1018601212, now seen corresponding path program 1 times [2025-03-03 15:08:27,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:27,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787533664] [2025-03-03 15:08:27,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:28,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:28,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:28,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:28,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:28,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-03-03 15:08:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:28,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787533664] [2025-03-03 15:08:28,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787533664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:28,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:28,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:28,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815471970] [2025-03-03 15:08:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:28,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:28,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:28,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:28,177 INFO L87 Difference]: Start difference. First operand 13660 states and 19976 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-03-03 15:08:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:29,413 INFO L93 Difference]: Finished difference Result 20504 states and 29917 transitions. [2025-03-03 15:08:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:29,414 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-03-03 15:08:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:29,437 INFO L225 Difference]: With dead ends: 20504 [2025-03-03 15:08:29,437 INFO L226 Difference]: Without dead ends: 20068 [2025-03-03 15:08:29,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:29,445 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 5892 mSDsluCounter, 3053 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5892 SdHoareTripleChecker+Valid, 3815 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:29,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5892 Valid, 3815 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:08:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20068 states. [2025-03-03 15:08:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20068 to 13660. [2025-03-03 15:08:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13660 states, 13653 states have (on average 1.4629751702922436) internal successors, (19974), 13659 states have internal predecessors, (19974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13660 states to 13660 states and 19974 transitions. [2025-03-03 15:08:29,657 INFO L78 Accepts]: Start accepts. Automaton has 13660 states and 19974 transitions. Word has length 71 [2025-03-03 15:08:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:29,657 INFO L471 AbstractCegarLoop]: Abstraction has 13660 states and 19974 transitions. [2025-03-03 15:08:29,657 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-03-03 15:08:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 13660 states and 19974 transitions. [2025-03-03 15:08:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:29,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:29,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:29,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:08:29,659 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:29,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1782008244, now seen corresponding path program 1 times [2025-03-03 15:08:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132136331] [2025-03-03 15:08:29,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:29,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:29,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:29,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:29,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132136331] [2025-03-03 15:08:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132136331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:29,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:29,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758179901] [2025-03-03 15:08:29,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:29,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:29,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:29,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:29,821 INFO L87 Difference]: Start difference. First operand 13660 states and 19974 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-03-03 15:08:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:30,808 INFO L93 Difference]: Finished difference Result 17624 states and 25626 transitions. [2025-03-03 15:08:30,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:30,809 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-03-03 15:08:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:30,826 INFO L225 Difference]: With dead ends: 17624 [2025-03-03 15:08:30,826 INFO L226 Difference]: Without dead ends: 17226 [2025-03-03 15:08:30,831 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-03-03 15:08:30,831 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 6871 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6871 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:30,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6871 Valid, 3318 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:08:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17226 states. [2025-03-03 15:08:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17226 to 13660. [2025-03-03 15:08:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13660 states, 13653 states have (on average 1.4628286823408774) internal successors, (19972), 13659 states have internal predecessors, (19972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13660 states to 13660 states and 19972 transitions. [2025-03-03 15:08:30,965 INFO L78 Accepts]: Start accepts. Automaton has 13660 states and 19972 transitions. Word has length 71 [2025-03-03 15:08:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:30,965 INFO L471 AbstractCegarLoop]: Abstraction has 13660 states and 19972 transitions. [2025-03-03 15:08:30,965 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-03-03 15:08:30,965 INFO L276 IsEmpty]: Start isEmpty. Operand 13660 states and 19972 transitions. [2025-03-03 15:08:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:08:30,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:30,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:30,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:08:30,967 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:30,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:30,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1904682036, now seen corresponding path program 1 times [2025-03-03 15:08:30,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:30,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751276618] [2025-03-03 15:08:30,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:30,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:30,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:08:30,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:08:30,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:30,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751276618] [2025-03-03 15:08:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751276618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:31,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:08:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780595071] [2025-03-03 15:08:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:31,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:08:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:31,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:08:31,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:08:31,198 INFO L87 Difference]: Start difference. First operand 13660 states and 19972 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 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-03-03 15:08:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:32,755 INFO L93 Difference]: Finished difference Result 33182 states and 48486 transitions. [2025-03-03 15:08:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:08:32,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 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-03-03 15:08:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:32,793 INFO L225 Difference]: With dead ends: 33182 [2025-03-03 15:08:32,793 INFO L226 Difference]: Without dead ends: 32646 [2025-03-03 15:08:32,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2025-03-03 15:08:32,805 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 5757 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 4013 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5757 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 4013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:32,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5757 Valid, 4248 Invalid, 4103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 4013 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:08:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32646 states. [2025-03-03 15:08:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32646 to 13660. [2025-03-03 15:08:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13660 states, 13653 states have (on average 1.4626821943895114) internal successors, (19970), 13659 states have internal predecessors, (19970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13660 states to 13660 states and 19970 transitions. [2025-03-03 15:08:33,016 INFO L78 Accepts]: Start accepts. Automaton has 13660 states and 19970 transitions. Word has length 71 [2025-03-03 15:08:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:33,016 INFO L471 AbstractCegarLoop]: Abstraction has 13660 states and 19970 transitions. [2025-03-03 15:08:33,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 10 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-03-03 15:08:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 13660 states and 19970 transitions. [2025-03-03 15:08:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:33,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:33,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:33,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:08:33,018 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:33,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:33,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1405477795, now seen corresponding path program 1 times [2025-03-03 15:08:33,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:33,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867777287] [2025-03-03 15:08:33,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:33,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:33,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:33,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:33,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:33,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:33,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867777287] [2025-03-03 15:08:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867777287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:33,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:33,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553005487] [2025-03-03 15:08:33,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:33,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:33,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:33,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:33,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:33,064 INFO L87 Difference]: Start difference. First operand 13660 states and 19970 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:33,151 INFO L93 Difference]: Finished difference Result 31366 states and 46663 transitions. [2025-03-03 15:08:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:33,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:33,171 INFO L225 Difference]: With dead ends: 31366 [2025-03-03 15:08:33,171 INFO L226 Difference]: Without dead ends: 19624 [2025-03-03 15:08:33,183 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-03-03 15:08:33,183 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 877 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:33,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1927 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19624 states. [2025-03-03 15:08:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19624 to 15803. [2025-03-03 15:08:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15803 states, 15796 states have (on average 1.4610027855153203) internal successors, (23078), 15802 states have internal predecessors, (23078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 23078 transitions. [2025-03-03 15:08:33,334 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 23078 transitions. Word has length 72 [2025-03-03 15:08:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:33,334 INFO L471 AbstractCegarLoop]: Abstraction has 15803 states and 23078 transitions. [2025-03-03 15:08:33,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 23078 transitions. [2025-03-03 15:08:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:33,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:33,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:33,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:08:33,336 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:33,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1958706504, now seen corresponding path program 1 times [2025-03-03 15:08:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037517016] [2025-03-03 15:08:33,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:33,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:33,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:33,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:33,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:33,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037517016] [2025-03-03 15:08:33,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037517016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:33,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:33,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780227173] [2025-03-03 15:08:33,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:33,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:33,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:33,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:33,502 INFO L87 Difference]: Start difference. First operand 15803 states and 23078 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:34,607 INFO L93 Difference]: Finished difference Result 37714 states and 55330 transitions. [2025-03-03 15:08:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:08:34,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:34,645 INFO L225 Difference]: With dead ends: 37714 [2025-03-03 15:08:34,645 INFO L226 Difference]: Without dead ends: 37585 [2025-03-03 15:08:34,654 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-03-03 15:08:34,654 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 6035 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6035 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:34,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6035 Valid, 3392 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:08:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37585 states. [2025-03-03 15:08:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37585 to 15798. [2025-03-03 15:08:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15798 states, 15791 states have (on average 1.4608954467734785) internal successors, (23069), 15797 states have internal predecessors, (23069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15798 states to 15798 states and 23069 transitions. [2025-03-03 15:08:34,880 INFO L78 Accepts]: Start accepts. Automaton has 15798 states and 23069 transitions. Word has length 72 [2025-03-03 15:08:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:34,881 INFO L471 AbstractCegarLoop]: Abstraction has 15798 states and 23069 transitions. [2025-03-03 15:08:34,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 15798 states and 23069 transitions. [2025-03-03 15:08:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:08:34,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:34,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:34,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:08:34,883 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:34,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:34,883 INFO L85 PathProgramCache]: Analyzing trace with hash 298845499, now seen corresponding path program 1 times [2025-03-03 15:08:34,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:34,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965651687] [2025-03-03 15:08:34,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:34,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:08:34,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:08:34,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:34,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:35,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-03-03 15:08:35,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:35,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965651687] [2025-03-03 15:08:35,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965651687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:35,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174258302] [2025-03-03 15:08:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:35,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:35,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:35,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:35,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:35,031 INFO L87 Difference]: Start difference. First operand 15798 states and 23069 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:36,050 INFO L93 Difference]: Finished difference Result 20144 states and 29213 transitions. [2025-03-03 15:08:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:36,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-03 15:08:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:36,072 INFO L225 Difference]: With dead ends: 20144 [2025-03-03 15:08:36,072 INFO L226 Difference]: Without dead ends: 20015 [2025-03-03 15:08:36,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:36,080 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 3254 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 2717 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3254 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:36,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3254 Valid, 3277 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:08:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20015 states. [2025-03-03 15:08:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20015 to 15794. [2025-03-03 15:08:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15794 states, 15787 states have (on average 1.460948881991512) internal successors, (23064), 15793 states have internal predecessors, (23064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15794 states to 15794 states and 23064 transitions. [2025-03-03 15:08:36,243 INFO L78 Accepts]: Start accepts. Automaton has 15794 states and 23064 transitions. Word has length 72 [2025-03-03 15:08:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:36,244 INFO L471 AbstractCegarLoop]: Abstraction has 15794 states and 23064 transitions. [2025-03-03 15:08:36,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 15794 states and 23064 transitions. [2025-03-03 15:08:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:36,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:36,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:36,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:08:36,246 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:36,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1489074189, now seen corresponding path program 1 times [2025-03-03 15:08:36,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:36,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763315778] [2025-03-03 15:08:36,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:36,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:36,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:36,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:36,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:36,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:36,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763315778] [2025-03-03 15:08:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763315778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:36,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:36,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:08:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842179933] [2025-03-03 15:08:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:36,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:08:36,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:36,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:08:36,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:08:36,580 INFO L87 Difference]: Start difference. First operand 15794 states and 23064 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:37,171 INFO L93 Difference]: Finished difference Result 26641 states and 39015 transitions. [2025-03-03 15:08:37,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 15:08:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:37,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:37,204 INFO L225 Difference]: With dead ends: 26641 [2025-03-03 15:08:37,204 INFO L226 Difference]: Without dead ends: 26446 [2025-03-03 15:08:37,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:08:37,214 INFO L435 NwaCegarLoop]: 1123 mSDtfsCounter, 4892 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4892 SdHoareTripleChecker+Valid, 5178 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:37,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4892 Valid, 5178 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26446 states. [2025-03-03 15:08:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26446 to 15723. [2025-03-03 15:08:37,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15723 states, 15719 states have (on average 1.461352503339907) internal successors, (22971), 15722 states have internal predecessors, (22971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15723 states to 15723 states and 22971 transitions. [2025-03-03 15:08:37,457 INFO L78 Accepts]: Start accepts. Automaton has 15723 states and 22971 transitions. Word has length 74 [2025-03-03 15:08:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:37,457 INFO L471 AbstractCegarLoop]: Abstraction has 15723 states and 22971 transitions. [2025-03-03 15:08:37,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 15723 states and 22971 transitions. [2025-03-03 15:08:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:37,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:37,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:37,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:08:37,460 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:37,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1426386485, now seen corresponding path program 1 times [2025-03-03 15:08:37,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:37,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006203067] [2025-03-03 15:08:37,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:37,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:37,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:37,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:37,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:37,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:37,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006203067] [2025-03-03 15:08:37,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006203067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:37,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:37,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332946559] [2025-03-03 15:08:37,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:37,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:37,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:37,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:37,823 INFO L87 Difference]: Start difference. First operand 15723 states and 22971 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:38,651 INFO L93 Difference]: Finished difference Result 45739 states and 67144 transitions. [2025-03-03 15:08:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:08:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:38,701 INFO L225 Difference]: With dead ends: 45739 [2025-03-03 15:08:38,701 INFO L226 Difference]: Without dead ends: 45609 [2025-03-03 15:08:38,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:38,717 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 7949 mSDsluCounter, 6806 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7949 SdHoareTripleChecker+Valid, 7969 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:38,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7949 Valid, 7969 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45609 states. [2025-03-03 15:08:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45609 to 15717. [2025-03-03 15:08:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15717 states, 15714 states have (on average 1.4612447499045438) internal successors, (22962), 15716 states have internal predecessors, (22962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15717 states to 15717 states and 22962 transitions. [2025-03-03 15:08:39,051 INFO L78 Accepts]: Start accepts. Automaton has 15717 states and 22962 transitions. Word has length 74 [2025-03-03 15:08:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:39,051 INFO L471 AbstractCegarLoop]: Abstraction has 15717 states and 22962 transitions. [2025-03-03 15:08:39,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 15717 states and 22962 transitions. [2025-03-03 15:08:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:39,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:39,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:39,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:08:39,054 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:39,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash -600809324, now seen corresponding path program 1 times [2025-03-03 15:08:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:39,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438820180] [2025-03-03 15:08:39,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:39,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:39,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:39,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:39,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438820180] [2025-03-03 15:08:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438820180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:39,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:39,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:39,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662300450] [2025-03-03 15:08:39,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:39,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:39,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:39,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:39,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:39,392 INFO L87 Difference]: Start difference. First operand 15717 states and 22962 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:40,805 INFO L93 Difference]: Finished difference Result 57794 states and 84389 transitions. [2025-03-03 15:08:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 15:08:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:40,867 INFO L225 Difference]: With dead ends: 57794 [2025-03-03 15:08:40,867 INFO L226 Difference]: Without dead ends: 57602 [2025-03-03 15:08:40,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:08:40,886 INFO L435 NwaCegarLoop]: 1283 mSDtfsCounter, 7885 mSDsluCounter, 9441 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7885 SdHoareTripleChecker+Valid, 10724 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:40,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7885 Valid, 10724 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:08:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57602 states. [2025-03-03 15:08:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57602 to 15649. [2025-03-03 15:08:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15649 states, 15648 states have (on average 1.4615286298568506) internal successors, (22870), 15648 states have internal predecessors, (22870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15649 states to 15649 states and 22870 transitions. [2025-03-03 15:08:41,194 INFO L78 Accepts]: Start accepts. Automaton has 15649 states and 22870 transitions. Word has length 74 [2025-03-03 15:08:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:41,194 INFO L471 AbstractCegarLoop]: Abstraction has 15649 states and 22870 transitions. [2025-03-03 15:08:41,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15649 states and 22870 transitions. [2025-03-03 15:08:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:08:41,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:41,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:41,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:08:41,198 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:41,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1721098331, now seen corresponding path program 1 times [2025-03-03 15:08:41,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:41,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796413272] [2025-03-03 15:08:41,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:41,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:08:41,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:08:41,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:41,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:41,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796413272] [2025-03-03 15:08:41,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796413272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:41,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:41,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:41,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914848637] [2025-03-03 15:08:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:41,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:41,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:41,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:41,281 INFO L87 Difference]: Start difference. First operand 15649 states and 22870 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:41,526 INFO L93 Difference]: Finished difference Result 58688 states and 86640 transitions. [2025-03-03 15:08:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:41,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 15:08:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:41,575 INFO L225 Difference]: With dead ends: 58688 [2025-03-03 15:08:41,575 INFO L226 Difference]: Without dead ends: 44606 [2025-03-03 15:08:41,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:41,593 INFO L435 NwaCegarLoop]: 1207 mSDtfsCounter, 4316 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4316 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:41,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4316 Valid, 2632 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44606 states. [2025-03-03 15:08:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44606 to 28954. [2025-03-03 15:08:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28954 states, 28953 states have (on average 1.455565917176113) internal successors, (42143), 28953 states have internal predecessors, (42143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28954 states to 28954 states and 42143 transitions. [2025-03-03 15:08:41,967 INFO L78 Accepts]: Start accepts. Automaton has 28954 states and 42143 transitions. Word has length 80 [2025-03-03 15:08:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:41,968 INFO L471 AbstractCegarLoop]: Abstraction has 28954 states and 42143 transitions. [2025-03-03 15:08:41,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 28954 states and 42143 transitions. [2025-03-03 15:08:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:08:41,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:41,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:41,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:08:41,972 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1730912320, now seen corresponding path program 1 times [2025-03-03 15:08:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096178389] [2025-03-03 15:08:41,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:41,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:08:41,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:08:41,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:42,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096178389] [2025-03-03 15:08:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096178389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:42,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018702709] [2025-03-03 15:08:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:42,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:42,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:42,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:42,067 INFO L87 Difference]: Start difference. First operand 28954 states and 42143 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:42,255 INFO L93 Difference]: Finished difference Result 51506 states and 75141 transitions. [2025-03-03 15:08:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:42,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 15:08:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:42,282 INFO L225 Difference]: With dead ends: 51506 [2025-03-03 15:08:42,282 INFO L226 Difference]: Without dead ends: 24102 [2025-03-03 15:08:42,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:42,310 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 3238 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3238 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:42,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3238 Valid, 1775 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24102 states. [2025-03-03 15:08:42,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24102 to 24096. [2025-03-03 15:08:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24096 states, 24095 states have (on average 1.4465241751400706) internal successors, (34854), 24095 states have internal predecessors, (34854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24096 states to 24096 states and 34854 transitions. [2025-03-03 15:08:42,537 INFO L78 Accepts]: Start accepts. Automaton has 24096 states and 34854 transitions. Word has length 81 [2025-03-03 15:08:42,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:42,538 INFO L471 AbstractCegarLoop]: Abstraction has 24096 states and 34854 transitions. [2025-03-03 15:08:42,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 24096 states and 34854 transitions. [2025-03-03 15:08:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:08:42,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:42,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:42,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:08:42,543 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:42,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1507674445, now seen corresponding path program 1 times [2025-03-03 15:08:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:42,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829090192] [2025-03-03 15:08:42,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:42,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:08:42,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:08:42,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:42,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:42,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-03-03 15:08:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829090192] [2025-03-03 15:08:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829090192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:42,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:42,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337659727] [2025-03-03 15:08:42,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:42,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:42,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:42,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:42,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:42,617 INFO L87 Difference]: Start difference. First operand 24096 states and 34854 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:42,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:42,808 INFO L93 Difference]: Finished difference Result 67536 states and 98164 transitions. [2025-03-03 15:08:42,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-03 15:08:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:42,858 INFO L225 Difference]: With dead ends: 67536 [2025-03-03 15:08:42,858 INFO L226 Difference]: Without dead ends: 44990 [2025-03-03 15:08:42,881 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-03-03 15:08:42,882 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 726 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:42,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1720 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44990 states. [2025-03-03 15:08:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44990 to 42748. [2025-03-03 15:08:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42748 states, 42747 states have (on average 1.4445926029896834) internal successors, (61752), 42747 states have internal predecessors, (61752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42748 states to 42748 states and 61752 transitions. [2025-03-03 15:08:43,362 INFO L78 Accepts]: Start accepts. Automaton has 42748 states and 61752 transitions. Word has length 83 [2025-03-03 15:08:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:43,362 INFO L471 AbstractCegarLoop]: Abstraction has 42748 states and 61752 transitions. [2025-03-03 15:08:43,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 42748 states and 61752 transitions. [2025-03-03 15:08:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:08:43,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:43,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:43,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:08:43,366 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:43,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2016373801, now seen corresponding path program 1 times [2025-03-03 15:08:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354571989] [2025-03-03 15:08:43,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:43,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:08:43,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:08:43,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:43,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:43,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:43,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354571989] [2025-03-03 15:08:43,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354571989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:43,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:43,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:43,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415694347] [2025-03-03 15:08:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:43,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:43,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:43,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:43,446 INFO L87 Difference]: Start difference. First operand 42748 states and 61752 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:43,737 INFO L93 Difference]: Finished difference Result 121840 states and 176178 transitions. [2025-03-03 15:08:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:43,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-03 15:08:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:43,831 INFO L225 Difference]: With dead ends: 121840 [2025-03-03 15:08:43,831 INFO L226 Difference]: Without dead ends: 80642 [2025-03-03 15:08:43,874 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-03-03 15:08:43,875 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 606 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:43,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1797 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80642 states. [2025-03-03 15:08:44,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80642 to 76160. [2025-03-03 15:08:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76160 states, 76159 states have (on average 1.4371512230990429) internal successors, (109452), 76159 states have internal predecessors, (109452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76160 states to 76160 states and 109452 transitions. [2025-03-03 15:08:44,866 INFO L78 Accepts]: Start accepts. Automaton has 76160 states and 109452 transitions. Word has length 84 [2025-03-03 15:08:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:44,866 INFO L471 AbstractCegarLoop]: Abstraction has 76160 states and 109452 transitions. [2025-03-03 15:08:44,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 76160 states and 109452 transitions. [2025-03-03 15:08:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:08:44,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:44,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:44,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:08:44,871 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2025-03-03 15:08:44,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash 703710064, now seen corresponding path program 1 times [2025-03-03 15:08:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300128413] [2025-03-03 15:08:44,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:08:44,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:08:44,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:44,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:44,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:44,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300128413] [2025-03-03 15:08:44,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300128413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:44,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:44,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270123420] [2025-03-03 15:08:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:44,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:44,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:44,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:44,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:44,972 INFO L87 Difference]: Start difference. First operand 76160 states and 109452 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:45,558 INFO L93 Difference]: Finished difference Result 218772 states and 313918 transitions. [2025-03-03 15:08:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-03 15:08:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:45,724 INFO L225 Difference]: With dead ends: 218772 [2025-03-03 15:08:45,725 INFO L226 Difference]: Without dead ends: 144104 [2025-03-03 15:08:45,801 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-03-03 15:08:45,802 INFO L435 NwaCegarLoop]: 1196 mSDtfsCounter, 775 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:45,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1604 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144104 states.