./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-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 2b77f3a84818afa598b0eb39254acb84b353143275f6b4c2e95d15ee5488d008 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:28:56,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:28:56,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:28:56,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:28:56,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:28:56,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:28:56,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:28:56,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:28:56,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:28:56,849 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:28:56,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:28:56,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:28:56,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:28:56,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:28:56,850 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:28:56,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:28:56,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:28:56,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:28:56,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:28:56,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:28:56,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:28:56,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:28:56,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:28:56,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:28:56,853 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 -> 2b77f3a84818afa598b0eb39254acb84b353143275f6b4c2e95d15ee5488d008 [2025-03-08 06:28:57,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:28:57,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:28:57,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:28:57,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:28:57,081 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:28:57,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:28:58,209 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d38d608/522aa276d8d24d24ac9f73bac07d8cad/FLAG995c672da [2025-03-08 06:28:58,726 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:28:58,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:28:58,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d38d608/522aa276d8d24d24ac9f73bac07d8cad/FLAG995c672da [2025-03-08 06:28:58,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d38d608/522aa276d8d24d24ac9f73bac07d8cad [2025-03-08 06:28:58,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:28:58,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:28:58,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:28:58,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:28:58,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:28:58,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:28:58" (1/1) ... [2025-03-08 06:28:58,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:28:58, skipping insertion in model container [2025-03-08 06:28:58,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:28:58" (1/1) ... [2025-03-08 06:28:58,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:28:59,261 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16849,16862] [2025-03-08 06:28:59,280 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21942,21955] [2025-03-08 06:28:59,285 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23299,23312] [2025-03-08 06:28:59,289 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24107,24120] [2025-03-08 06:28:59,298 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25792,25805] [2025-03-08 06:28:59,302 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26600,26613] [2025-03-08 06:28:59,308 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27736,27749] [2025-03-08 06:28:59,321 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30390,30403] [2025-03-08 06:28:59,324 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31201,31214] [2025-03-08 06:28:59,328 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32340,32353] [2025-03-08 06:28:59,337 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34445,34458] [2025-03-08 06:28:59,349 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38533,38546] [2025-03-08 06:28:59,352 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[39344,39357] [2025-03-08 06:28:59,355 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40483,40496] [2025-03-08 06:28:59,361 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[42588,42601] [2025-03-08 06:28:59,371 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[46127,46140] [2025-03-08 06:28:59,387 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52573,52586] [2025-03-08 06:28:59,391 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[53384,53397] [2025-03-08 06:28:59,396 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[54527,54540] [2025-03-08 06:28:59,402 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[56636,56649] [2025-03-08 06:28:59,412 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60424,60437] [2025-03-08 06:28:59,429 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67072,67085] [2025-03-08 06:28:59,457 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[79206,79219] [2025-03-08 06:28:59,460 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[80017,80030] [2025-03-08 06:28:59,463 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[81156,81169] [2025-03-08 06:28:59,469 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[83261,83274] [2025-03-08 06:28:59,478 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[86800,86813] [2025-03-08 06:28:59,491 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[92697,92710] [2025-03-08 06:28:59,538 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[102772,102785] [2025-03-08 06:28:59,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:28:59,875 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:28:59,943 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16849,16862] [2025-03-08 06:28:59,961 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21942,21955] [2025-03-08 06:29:00,006 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23299,23312] [2025-03-08 06:29:00,011 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24107,24120] [2025-03-08 06:29:00,020 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25792,25805] [2025-03-08 06:29:00,028 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26600,26613] [2025-03-08 06:29:00,035 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27736,27749] [2025-03-08 06:29:00,049 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30390,30403] [2025-03-08 06:29:00,055 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31201,31214] [2025-03-08 06:29:00,062 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[32340,32353] [2025-03-08 06:29:00,074 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34445,34458] [2025-03-08 06:29:00,094 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38533,38546] [2025-03-08 06:29:00,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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[39344,39357] [2025-03-08 06:29:00,100 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[40483,40496] [2025-03-08 06:29:00,106 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[42588,42601] [2025-03-08 06:29:00,114 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[46127,46140] [2025-03-08 06:29:00,125 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52573,52586] [2025-03-08 06:29:00,128 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[53384,53397] [2025-03-08 06:29:00,133 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[54527,54540] [2025-03-08 06:29:00,137 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[56636,56649] [2025-03-08 06:29:00,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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60424,60437] [2025-03-08 06:29:00,160 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67072,67085] [2025-03-08 06:29:00,185 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[79206,79219] [2025-03-08 06:29:00,188 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[80017,80030] [2025-03-08 06:29:00,192 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[81156,81169] [2025-03-08 06:29:00,197 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[83261,83274] [2025-03-08 06:29:00,204 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[86800,86813] [2025-03-08 06:29:00,214 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[92697,92710] [2025-03-08 06:29:00,230 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.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[102772,102785] [2025-03-08 06:29:00,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:00,506 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:29:00,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00 WrapperNode [2025-03-08 06:29:00,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:00,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:00,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:29:00,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:29:00,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,750 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12868 [2025-03-08 06:29:00,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:00,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:29:00,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:29:00,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:29:00,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,867 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-08 06:29:00,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:00,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:01,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:29:01,029 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:29:01,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:29:01,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:29:01,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (1/1) ... [2025-03-08 06:29:01,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:01,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:29:01,059 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-08 06:29:01,062 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-08 06:29:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:29:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:29:01,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:29:01,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:29:01,395 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:29:01,396 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:29:05,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16353: havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~147#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17675: havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~161#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2614: havoc main_~node7__m7~11#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9750: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~76#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13450: havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~116#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4994: havoc main_~node5__m5~9#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12393: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7108: havoc main_~node7__m7~49#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17150: havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~156#1; [2025-03-08 06:29:05,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18472: havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~170#1; [2025-03-08 06:29:05,682 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19793: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8168: havoc main_~check__tmp~65#1;havoc main_~node7__m7~58#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16096: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14247: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~94#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11869: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~81#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19269: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~121#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15569: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~101#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10550: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~38#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3946: havoc main_~check__tmp~34#1;havoc main_~node7__m7~21#1; [2025-03-08 06:29:05,683 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L775: havoc main_~node2__m2~2#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5532: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~44#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15310: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~136#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10029: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~79#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17429: havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~159#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13729: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~119#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5273: havoc main_~node7__m7~33#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5009: havoc main_~node6__m6~16#1; [2025-03-08 06:29:05,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7916: havoc main_~node6__m6~29#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18751: havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~173#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12410: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~43#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3690: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19810: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~63#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4219: havoc main_~check__tmp~37#1;havoc main_~node7__m7~23#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2105: havoc main_~check__tmp~13#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14526: havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~128#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16113: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14792: havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~130#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12945: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~87#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10567: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~74#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20345: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~127#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L790: havoc main_~node3__m3~2#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6340: havoc main_~node7__m7~41#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9511: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~73#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13211: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~113#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: havoc main_~check__tmp~26#1;havoc main_~node7__m7~15#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16911: havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~153#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6078: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~51#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17970: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~58#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1058: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1852: havoc main_~node5__m5~3#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6873: havoc main_~node5__m5~13#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14008: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~122#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2910: havoc main_~check__tmp~23#1;havoc main_~node7__m7~13#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7931: havoc main_~node7__m7~56#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5819: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~48#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11105: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~77#1; [2025-03-08 06:29:05,685 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1328: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12427: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~84#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19827: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~124#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11635: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15071: havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~133#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3445: havoc main_~node3__m3~3#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16130: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~53#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2654: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10846: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~88#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L805: havoc main_~node4__m4~2#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12168: havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~102#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15868: havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~142#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19568: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~182#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8470: havoc main_~node5__m5~17#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9265: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~67#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1602: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16665: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~107#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14287: havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~125#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1867: havoc main_~node6__m6~4#1; [2025-03-08 06:29:05,686 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17987: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~114#1; [2025-03-08 06:29:05,687 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11909: havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~99#1; [2025-03-08 06:29:05,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6888: havoc main_~node6__m6~24#1; [2025-03-08 06:29:05,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15609: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~139#1; [2025-03-08 06:29:05,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19309: havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~179#1; [2025-03-08 06:29:05,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-08 06:29:05,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12706: havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~108#1; [2025-03-08 06:29:05,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10328: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~82#1; [2025-03-08 06:29:05,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20106: havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~188#1; [2025-03-08 06:29:05,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11652: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-08 06:29:05,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3460: havoc main_~node4__m4~4#1; [2025-03-08 06:29:05,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19052: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6633: havoc main_~check__tmp~57#1;havoc main_~node7__m7~43#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16147: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~104#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18525: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~117#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc main_~node5__m5~2#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4520: havoc main_~node4__m4~5#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728: havoc main_~check__tmp~31#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9806: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~36#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8485: havoc main_~node6__m6~32#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13506: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~46#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17206: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~56#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5053: havoc main_~check__tmp~43#1;havoc main_~node7__m7~30#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882: havoc main_~node7__m7~6#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18266: havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~168#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7432: havoc main_~check__tmp~62#1;havoc main_~node7__m7~51#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4790: havoc main_~node6__m6~15#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12985: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~111#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10607: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~85#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8229: havoc main_~node7__m7~59#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20385: havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~191#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5587: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~45#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6116: havoc main_~check__tmp~52#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3475: havoc main_~node5__m5~6#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11404: havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~94#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9026: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~68#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11669: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16426: havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~148#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L835: havoc main_~node6__m6~2#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15369: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17748: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~162#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4535: havoc main_~node5__m5~8#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19069: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5857: havoc main_~check__tmp~49#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8500: havoc main_~node7__m7~62#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9823: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~70#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2424: havoc main_~node4__m4~3#1; [2025-03-08 06:29:05,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13523: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~90#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1103: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17223: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~110#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11145: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~91#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14845: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~97#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12467: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~105#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162: havoc main_~node6__m6~5#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19867: havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~185#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2692: havoc main_~check__tmp~20#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7715: havoc main_~node5__m5~15#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490: havoc main_~node6__m6~10#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1376: havoc main_~node7__m7~3#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14061: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~93#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9305: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~71#1; [2025-03-08 06:29:05,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16705: havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~151#1; [2025-03-08 06:29:05,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4550: havoc main_~node6__m6~14#1; [2025-03-08 06:29:05,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18027: havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~165#1; [2025-03-08 06:29:05,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L851: havoc main_~node7__m7~2#1; [2025-03-08 06:29:05,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11686: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~41#1; [2025-03-08 06:29:05,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15386: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~51#1; [2025-03-08 06:29:05,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14594: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-08 06:29:05,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19086: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~61#1; [2025-03-08 06:29:05,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10102: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~80#1; [2025-03-08 06:29:05,693 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13802: havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~120#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2439: havoc main_~node5__m5~4#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17502: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~160#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6932: havoc main_~check__tmp~59#1;havoc main_~node7__m7~46#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18824: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~174#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3234: havoc main_~node6__m6~9#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2177: havoc main_~node7__m7~8#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12221: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~83#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19621: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~123#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15921: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~103#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7994: havoc main_~node7__m7~57#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7730: havoc main_~node6__m6~28#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18565: havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~171#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16187: havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~145#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc main_~node7__m7~18#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4298: havoc main_~node6__m6~13#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10905: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9584: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~74#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13284: havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~114#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16984: havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~154#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: 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-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4565: havoc main_~node7__m7~26#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10381: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~73#1; [2025-03-08 06:29:05,694 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454: havoc main_~node6__m6~6#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11703: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~80#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15403: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~100#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14611: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19103: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~120#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4834: havoc main_~check__tmp~42#1;havoc main_~node7__m7~28#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12762: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~44#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20162: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~64#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4043: havoc main_~node5__m5~7#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5629: havoc main_~node7__m7~35#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15144: havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~134#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3785: havoc main_~node6__m6~11#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9863: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~77#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13563: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~117#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: havoc main_~node5__m5~5#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17263: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~157#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14885: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~131#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10922: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~39#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14360: havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~126#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11982: havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~100#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15682: havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~140#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469: havoc main_~node7__m7~10#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19382: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~180#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7226: havoc main_~node3__m3~5#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18325: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1148: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6698: havoc main_~node6__m6~23#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5114: havoc main_~node7__m7~31#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: havoc main_~node2__m2~1#1; [2025-03-08 06:29:05,695 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14628: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11457: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~79#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4058: havoc main_~node6__m6~12#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12779: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~86#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20179: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~126#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14101: havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~123#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17801: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~113#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9082: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~34#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16482: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~54#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6442: havoc main_~node4__m4~7#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3800: havoc main_~node7__m7~20#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3008: havoc main_~node6__m6~8#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1424: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2217: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10939: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~76#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12261: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~103#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L898: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15961: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~143#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6184: havoc main_~check__tmp~53#1;havoc main_~node7__m7~39#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7241: havoc main_~node4__m4~8#1; [2025-03-08 06:29:05,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19661: havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~183#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749: havoc main_~node6__m6~7#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563: havoc main_~node7__m7~63#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3278: havoc main_~check__tmp~27#1;havoc main_~node7__m7~16#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18342: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~59#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6979: havoc main_~node7__m7~47#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: havoc main_~node3__m3~1#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4073: havoc main_~node7__m7~22#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13058: havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~112#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10680: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~86#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20458: havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~192#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7774: havoc main_~check__tmp~64#1;havoc main_~node7__m7~54#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14645: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5925: havoc main_~check__tmp~50#1;havoc main_~node7__m7~37#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7511: havoc main_~node6__m6~27#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4605: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~39#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1699: havoc main_~node7__m7~5#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4342: havoc main_~check__tmp~38#1;havoc main_~node7__m7~24#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9099: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~66#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10421: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~83#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16499: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~106#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6457: havoc main_~node5__m5~12#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18877: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~119#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11743: havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~97#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15443: havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~137#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3023: havoc main_~node7__m7~14#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19143: havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~177#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3553: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8310: havoc main_~node6__m6~31#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11218: havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~92#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13861: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5669: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~46#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12540: havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~106#1; [2025-03-08 06:29:05,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19940: havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~186#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7256: havoc main_~node5__m5~14#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2764: havoc main_~node7__m7~12#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10164: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L652: havoc main_~node4__m4~1#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9637: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~69#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409: havoc main_~node2__m2~3#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13337: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~89#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17037: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~109#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18359: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~116#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17567: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14662: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~49#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9378: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~72#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16778: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~152#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6472: havoc main_~node6__m6~22#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18100: havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~166#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8325: havoc main_~node7__m7~60#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11497: havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~95#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15197: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~99#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12819: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~109#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1985: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6742: havoc main_~check__tmp~58#1;havoc main_~node7__m7~44#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20219: havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~189#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1193: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17841: havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~163#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7271: havoc main_~node6__m6~26#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13878: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~47#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4895: havoc main_~node7__m7~29#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc main_~node5__m5~1#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2517: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5424: havoc main_~node3__m3~4#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10181: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8860: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~66#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16260: havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~146#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18638: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~172#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3840: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~32#1; [2025-03-08 06:29:05,701 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc main_~check__tmp~15#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14413: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~95#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17584: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10979: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~89#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6487: havoc main_~node7__m7~42#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14679: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~96#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12038: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~42#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15738: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~52#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19438: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~62#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4113: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~35#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4643: havoc main_~check__tmp~40#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7286: havoc main_~node7__m7~50#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1739: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L682: havoc main_~node6__m6~1#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13895: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~92#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5439: havoc main_~node4__m4~6#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3325: havoc main_~node7__m7~17#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9139: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~69#1; [2025-03-08 06:29:05,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18917: havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~175#1; [2025-03-08 06:29:05,704 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16539: havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~149#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7555: havoc main_~check__tmp~63#1;havoc main_~node7__m7~52#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10198: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~37#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5707: havoc main_~check__tmp~47#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1479: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9936: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~78#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13636: havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~118#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17336: havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~158#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14958: havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~132#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17601: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10733: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~75#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12055: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~82#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9677: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~75#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15755: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~102#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17077: havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~155#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13377: havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~115#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19455: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~122#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18399: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~169#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8094: havoc main_~node4__m4~9#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14174: havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~124#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L697: havoc main_~node7__m7~1#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5454: havoc main_~node5__m5~10#1; [2025-03-08 06:29:05,705 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6249: havoc main_~node6__m6~21#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7835: havoc main_~node7__m7~55#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13120: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12593: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~85#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10215: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~72#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19993: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~125#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5195: havoc main_~node6__m6~17#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15237: havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~135#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7045: havoc main_~node6__m6~25#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4403: havoc main_~node7__m7~25#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11274: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L968: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17618: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~57#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2027: havoc main_~node7__m7~7#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12334: havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~104#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16034: havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~144#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3878: havoc main_~check__tmp~33#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19734: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~184#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8109: havoc main_~node5__m5~16#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6789: havoc main_~node7__m7~45#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14453: havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~127#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18153: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~115#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5469: havoc main_~node6__m6~18#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6527: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~55#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14719: havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~129#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8642: havoc main_~node7__m7~64#1;havoc main_~node6__m6~33#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4151: havoc main_~check__tmp~36#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10494: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~84#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13137: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16837: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11816: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~98#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15516: havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~138#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5210: havoc main_~node7__m7~32#1; [2025-03-08 06:29:05,706 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7060: havoc main_~node7__m7~48#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19216: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~178#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7326: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~60#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1777: havoc main_~check__tmp~9#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11291: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~78#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8913: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~65#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16313: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~105#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2572: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13935: havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~121#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17635: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~112#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: havoc main_~check__tmp~25#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6008: havoc main_~node5__m5~11#1; [2025-03-08 06:29:05,707 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18694: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~60#1; [2025-03-08 06:29:05,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8388: havoc main_~node7__m7~61#1; [2025-03-08 06:29:05,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8124: havoc main_~node6__m6~30#1; [2025-03-08 06:29:05,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:29:05,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5484: havoc main_~node7__m7~34#1; [2025-03-08 06:29:05,709 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2842: havoc main_~check__tmp~22#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10773: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~87#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12095: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~101#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15795: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~141#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19495: havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~181#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9454: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~35#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13154: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~45#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16854: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~55#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11570: havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~96#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12892: havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~110#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20292: havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~190#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2323: havoc main_~check__tmp~16#1;havoc main_~node7__m7~9#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17914: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~164#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6023: havoc main_~node6__m6~20#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9989: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~71#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13689: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~91#1; [2025-03-08 06:29:05,710 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17389: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~111#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18711: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~118#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12633: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~107#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10255: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~81#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20033: havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~187#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3650: havoc main_~node7__m7~19#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5764: havoc main_~node6__m6~19#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6293: havoc main_~check__tmp~54#1;havoc main_~node7__m7~40#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15014: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~50#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7616: havoc main_~node7__m7~53#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2067: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11052: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~90#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1539: havoc main_~node6__m6~3#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4711: havoc main_~check__tmp~41#1;havoc main_~node7__m7~27#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1013: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9471: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~68#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13171: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~88#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16871: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~108#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6565: havoc main_~check__tmp~56#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18193: havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~167#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6038: havoc main_~node7__m7~38#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14230: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L755: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9212: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~70#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16612: havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~150#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18990: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~176#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7364: havoc main_~check__tmp~61#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5779: havoc main_~node7__m7~36#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11331: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~93#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8953: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~67#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15031: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~98#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1554: havoc main_~node7__m7~4#1; [2025-03-08 06:29:05,711 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:29:06,182 INFO L? ?]: Removed 1884 outVars from TransFormulas that were not future-live. [2025-03-08 06:29:06,183 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:29:06,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:29:06,228 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:29:06,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:06 BoogieIcfgContainer [2025-03-08 06:29:06,228 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:29:06,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:29:06,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:29:06,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:29:06,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:28:58" (1/3) ... [2025-03-08 06:29:06,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791ec38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:06, skipping insertion in model container [2025-03-08 06:29:06,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:00" (2/3) ... [2025-03-08 06:29:06,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791ec38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:06, skipping insertion in model container [2025-03-08 06:29:06,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:06" (3/3) ... [2025-03-08 06:29:06,236 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-08 06:29:06,248 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:29:06,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 2064 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-08 06:29:06,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:29:06,362 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;@6c59677e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:29:06,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-08 06:29:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 2064 states, 2034 states have (on average 1.867748279252704) internal successors, (3799), 2063 states have internal predecessors, (3799), 0 states have call successors, (0), 0 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-08 06:29:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:29:06,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:06,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:06,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:06,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1943577688, now seen corresponding path program 1 times [2025-03-08 06:29:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236258272] [2025-03-08 06:29:06,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:06,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:29:06,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:29:06,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:06,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:06,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236258272] [2025-03-08 06:29:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236258272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:06,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:06,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:06,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134900912] [2025-03-08 06:29:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:06,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:06,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:07,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:07,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:07,014 INFO L87 Difference]: Start difference. First operand has 2064 states, 2034 states have (on average 1.867748279252704) internal successors, (3799), 2063 states have internal predecessors, (3799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-08 06:29:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:08,082 INFO L93 Difference]: Finished difference Result 3060 states and 5456 transitions. [2025-03-08 06:29:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:08,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-08 06:29:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:08,099 INFO L225 Difference]: With dead ends: 3060 [2025-03-08 06:29:08,100 INFO L226 Difference]: Without dead ends: 1573 [2025-03-08 06:29:08,109 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-08 06:29:08,111 INFO L435 NwaCegarLoop]: 1836 mSDtfsCounter, 8224 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8224 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:08,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8224 Valid, 1898 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-08 06:29:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2025-03-08 06:29:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1544 states have (on average 1.3264248704663213) internal successors, (2048), 1572 states have internal predecessors, (2048), 0 states have call successors, (0), 0 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-08 06:29:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2048 transitions. [2025-03-08 06:29:08,192 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2048 transitions. Word has length 100 [2025-03-08 06:29:08,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:08,192 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2048 transitions. [2025-03-08 06:29:08,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 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-08 06:29:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2048 transitions. [2025-03-08 06:29:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:29:08,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:08,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:29:08,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:08,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash -931462523, now seen corresponding path program 1 times [2025-03-08 06:29:08,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:08,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120926557] [2025-03-08 06:29:08,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:08,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:29:08,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:29:08,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:08,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:08,412 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-08 06:29:08,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:08,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120926557] [2025-03-08 06:29:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120926557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:08,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:08,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:08,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299485914] [2025-03-08 06:29:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:08,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:08,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:08,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:08,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:08,413 INFO L87 Difference]: Start difference. First operand 1573 states and 2048 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:09,356 INFO L93 Difference]: Finished difference Result 3139 states and 4251 transitions. [2025-03-08 06:29:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 06:29:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:09,362 INFO L225 Difference]: With dead ends: 3139 [2025-03-08 06:29:09,362 INFO L226 Difference]: Without dead ends: 1887 [2025-03-08 06:29:09,364 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-08 06:29:09,364 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 6792 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6792 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:09,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6792 Valid, 1447 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2025-03-08 06:29:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1785. [2025-03-08 06:29:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1756 states have (on average 1.4071753986332574) internal successors, (2471), 1784 states have internal predecessors, (2471), 0 states have call successors, (0), 0 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-08 06:29:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2471 transitions. [2025-03-08 06:29:09,406 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2471 transitions. Word has length 101 [2025-03-08 06:29:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:09,407 INFO L471 AbstractCegarLoop]: Abstraction has 1785 states and 2471 transitions. [2025-03-08 06:29:09,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2471 transitions. [2025-03-08 06:29:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:29:09,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:09,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:09,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:29:09,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:09,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1712120016, now seen corresponding path program 1 times [2025-03-08 06:29:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192381727] [2025-03-08 06:29:09,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:09,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:29:09,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:29:09,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:09,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:09,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192381727] [2025-03-08 06:29:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192381727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:09,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789418947] [2025-03-08 06:29:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:09,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:09,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:09,587 INFO L87 Difference]: Start difference. First operand 1785 states and 2471 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:10,211 INFO L93 Difference]: Finished difference Result 3249 states and 4590 transitions. [2025-03-08 06:29:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:10,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-08 06:29:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:10,217 INFO L225 Difference]: With dead ends: 3249 [2025-03-08 06:29:10,217 INFO L226 Difference]: Without dead ends: 1654 [2025-03-08 06:29:10,219 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-08 06:29:10,219 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 4733 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4733 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:10,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4733 Valid, 911 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:10,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-03-08 06:29:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1654. [2025-03-08 06:29:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1625 states have (on average 1.428923076923077) internal successors, (2322), 1653 states have internal predecessors, (2322), 0 states have call successors, (0), 0 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-08 06:29:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2322 transitions. [2025-03-08 06:29:10,246 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2322 transitions. Word has length 102 [2025-03-08 06:29:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:10,246 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2322 transitions. [2025-03-08 06:29:10,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2322 transitions. [2025-03-08 06:29:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:29:10,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:10,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:10,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:29:10,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:10,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1308999379, now seen corresponding path program 1 times [2025-03-08 06:29:10,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:10,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676372952] [2025-03-08 06:29:10,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:10,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:10,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:29:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:29:10,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:10,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:10,434 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-08 06:29:10,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676372952] [2025-03-08 06:29:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676372952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:10,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:10,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:10,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247057712] [2025-03-08 06:29:10,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:10,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:10,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:10,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:10,436 INFO L87 Difference]: Start difference. First operand 1654 states and 2322 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:11,181 INFO L93 Difference]: Finished difference Result 3118 states and 4439 transitions. [2025-03-08 06:29:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:11,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 06:29:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:11,186 INFO L225 Difference]: With dead ends: 3118 [2025-03-08 06:29:11,186 INFO L226 Difference]: Without dead ends: 1614 [2025-03-08 06:29:11,188 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-08 06:29:11,189 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 4473 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4473 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:11,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4473 Valid, 697 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2025-03-08 06:29:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1614. [2025-03-08 06:29:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1585 states have (on average 1.4334384858044165) internal successors, (2272), 1613 states have internal predecessors, (2272), 0 states have call successors, (0), 0 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-08 06:29:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2272 transitions. [2025-03-08 06:29:11,212 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2272 transitions. Word has length 103 [2025-03-08 06:29:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:11,212 INFO L471 AbstractCegarLoop]: Abstraction has 1614 states and 2272 transitions. [2025-03-08 06:29:11,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2272 transitions. [2025-03-08 06:29:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 06:29:11,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:11,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:11,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:29:11,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:11,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash 336994120, now seen corresponding path program 1 times [2025-03-08 06:29:11,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:11,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795383849] [2025-03-08 06:29:11,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:11,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:11,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:29:11,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:29:11,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:11,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:11,361 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-08 06:29:11,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:11,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795383849] [2025-03-08 06:29:11,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795383849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:11,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:11,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242994576] [2025-03-08 06:29:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:11,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:11,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:11,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:11,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:11,363 INFO L87 Difference]: Start difference. First operand 1614 states and 2272 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:11,958 INFO L93 Difference]: Finished difference Result 3078 states and 4387 transitions. [2025-03-08 06:29:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:11,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 06:29:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:11,962 INFO L225 Difference]: With dead ends: 3078 [2025-03-08 06:29:11,963 INFO L226 Difference]: Without dead ends: 1582 [2025-03-08 06:29:11,965 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-08 06:29:11,965 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 4403 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4403 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:11,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4403 Valid, 788 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-08 06:29:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2025-03-08 06:29:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1553 states have (on average 1.4385061171925306) internal successors, (2234), 1581 states have internal predecessors, (2234), 0 states have call successors, (0), 0 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-08 06:29:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2234 transitions. [2025-03-08 06:29:11,991 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2234 transitions. Word has length 104 [2025-03-08 06:29:11,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:11,991 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2234 transitions. [2025-03-08 06:29:11,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2234 transitions. [2025-03-08 06:29:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 06:29:11,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:11,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:11,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:29:11,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:11,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:11,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2140938265, now seen corresponding path program 1 times [2025-03-08 06:29:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:11,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248314158] [2025-03-08 06:29:11,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:12,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:29:12,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:29:12,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:12,139 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-08 06:29:12,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:12,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248314158] [2025-03-08 06:29:12,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248314158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:12,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:12,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:12,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522640299] [2025-03-08 06:29:12,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:12,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:12,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:12,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:12,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:12,140 INFO L87 Difference]: Start difference. First operand 1582 states and 2234 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:12,670 INFO L93 Difference]: Finished difference Result 3046 states and 4347 transitions. [2025-03-08 06:29:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-08 06:29:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:12,675 INFO L225 Difference]: With dead ends: 3046 [2025-03-08 06:29:12,675 INFO L226 Difference]: Without dead ends: 1554 [2025-03-08 06:29:12,676 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-08 06:29:12,677 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 4369 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:12,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 833 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2025-03-08 06:29:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2025-03-08 06:29:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1525 states have (on average 1.4439344262295082) internal successors, (2202), 1553 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2202 transitions. [2025-03-08 06:29:12,699 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2202 transitions. Word has length 105 [2025-03-08 06:29:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:12,699 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2202 transitions. [2025-03-08 06:29:12,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2202 transitions. [2025-03-08 06:29:12,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:12,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:12,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:12,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:29:12,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:12,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 244669636, now seen corresponding path program 1 times [2025-03-08 06:29:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:12,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085730362] [2025-03-08 06:29:12,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:12,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:12,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:12,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:12,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:12,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-08 06:29:12,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085730362] [2025-03-08 06:29:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085730362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:12,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701434902] [2025-03-08 06:29:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:12,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:12,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:12,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:12,823 INFO L87 Difference]: Start difference. First operand 1554 states and 2202 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:13,298 INFO L93 Difference]: Finished difference Result 3018 states and 4313 transitions. [2025-03-08 06:29:13,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:13,303 INFO L225 Difference]: With dead ends: 3018 [2025-03-08 06:29:13,303 INFO L226 Difference]: Without dead ends: 1543 [2025-03-08 06:29:13,304 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-08 06:29:13,305 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 4296 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4296 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:13,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4296 Valid, 806 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-03-08 06:29:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1543. [2025-03-08 06:29:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4451783355350065) internal successors, (2188), 1542 states have internal predecessors, (2188), 0 states have call successors, (0), 0 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-08 06:29:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2188 transitions. [2025-03-08 06:29:13,325 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2188 transitions. Word has length 106 [2025-03-08 06:29:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2188 transitions. [2025-03-08 06:29:13,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2188 transitions. [2025-03-08 06:29:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:29:13,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:13,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:13,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:29:13,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:13,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash -752728560, now seen corresponding path program 1 times [2025-03-08 06:29:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:13,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764315166] [2025-03-08 06:29:13,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:13,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:13,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:29:13,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:29:13,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:13,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764315166] [2025-03-08 06:29:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764315166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:13,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:29:13,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095034791] [2025-03-08 06:29:13,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:13,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:29:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:13,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:29:13,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:29:13,773 INFO L87 Difference]: Start difference. First operand 1543 states and 2188 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:15,056 INFO L93 Difference]: Finished difference Result 2662 states and 3648 transitions. [2025-03-08 06:29:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:29:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 06:29:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:15,061 INFO L225 Difference]: With dead ends: 2662 [2025-03-08 06:29:15,061 INFO L226 Difference]: Without dead ends: 2002 [2025-03-08 06:29:15,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:15,063 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 4522 mSDsluCounter, 2041 mSDsCounter, 0 mSdLazyCounter, 3097 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:15,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 2693 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3097 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:15,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2025-03-08 06:29:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1543. [2025-03-08 06:29:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4445178335535007) internal successors, (2187), 1542 states have internal predecessors, (2187), 0 states have call successors, (0), 0 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-08 06:29:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2187 transitions. [2025-03-08 06:29:15,084 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2187 transitions. Word has length 107 [2025-03-08 06:29:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2187 transitions. [2025-03-08 06:29:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2187 transitions. [2025-03-08 06:29:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:29:15,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:15,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:15,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:29:15,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:15,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash -543565568, now seen corresponding path program 1 times [2025-03-08 06:29:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:15,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166229115] [2025-03-08 06:29:15,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:15,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:29:15,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:29:15,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:15,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:15,459 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-08 06:29:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:15,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166229115] [2025-03-08 06:29:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166229115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:15,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:15,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215246457] [2025-03-08 06:29:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:15,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:15,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:15,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:15,460 INFO L87 Difference]: Start difference. First operand 1543 states and 2187 transitions. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:16,985 INFO L93 Difference]: Finished difference Result 2015 states and 2876 transitions. [2025-03-08 06:29:16,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:16,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 06:29:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:16,989 INFO L225 Difference]: With dead ends: 2015 [2025-03-08 06:29:16,989 INFO L226 Difference]: Without dead ends: 1631 [2025-03-08 06:29:16,990 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-08 06:29:16,990 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 3927 mSDsluCounter, 3816 mSDsCounter, 0 mSdLazyCounter, 3864 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3927 SdHoareTripleChecker+Valid, 4678 SdHoareTripleChecker+Invalid, 3870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:16,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3927 Valid, 4678 Invalid, 3870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3864 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:29:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-08 06:29:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1543. [2025-03-08 06:29:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4438573315719947) internal successors, (2186), 1542 states have internal predecessors, (2186), 0 states have call successors, (0), 0 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-08 06:29:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2186 transitions. [2025-03-08 06:29:17,009 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2186 transitions. Word has length 107 [2025-03-08 06:29:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:17,009 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2186 transitions. [2025-03-08 06:29:17,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2186 transitions. [2025-03-08 06:29:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:29:17,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:17,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:17,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:29:17,012 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:17,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -485934658, now seen corresponding path program 1 times [2025-03-08 06:29:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:17,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026423443] [2025-03-08 06:29:17,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:17,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:17,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:29:17,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:29:17,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:17,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:17,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-08 06:29:17,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:17,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026423443] [2025-03-08 06:29:17,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026423443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:17,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:17,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:17,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761151152] [2025-03-08 06:29:17,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:17,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:17,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:17,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:17,280 INFO L87 Difference]: Start difference. First operand 1543 states and 2186 transitions. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:18,392 INFO L93 Difference]: Finished difference Result 2492 states and 3513 transitions. [2025-03-08 06:29:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:18,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 06:29:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:18,398 INFO L225 Difference]: With dead ends: 2492 [2025-03-08 06:29:18,398 INFO L226 Difference]: Without dead ends: 2314 [2025-03-08 06:29:18,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:18,399 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 3895 mSDsluCounter, 2585 mSDsCounter, 0 mSdLazyCounter, 2913 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3895 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:18,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3895 Valid, 3367 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2913 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-03-08 06:29:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1543. [2025-03-08 06:29:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4431968295904887) internal successors, (2185), 1542 states have internal predecessors, (2185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2185 transitions. [2025-03-08 06:29:18,417 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2185 transitions. Word has length 107 [2025-03-08 06:29:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:18,417 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2185 transitions. [2025-03-08 06:29:18,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2185 transitions. [2025-03-08 06:29:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:18,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:18,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:18,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:29:18,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:18,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1772782896, now seen corresponding path program 1 times [2025-03-08 06:29:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:18,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438397636] [2025-03-08 06:29:18,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:18,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:18,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:18,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:18,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:18,808 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-08 06:29:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438397636] [2025-03-08 06:29:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438397636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:18,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:18,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:18,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695315174] [2025-03-08 06:29:18,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:18,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:18,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:18,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:18,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:18,810 INFO L87 Difference]: Start difference. First operand 1543 states and 2185 transitions. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 11 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:20,623 INFO L93 Difference]: Finished difference Result 2850 states and 4037 transitions. [2025-03-08 06:29:20,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:20,623 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 11 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:20,629 INFO L225 Difference]: With dead ends: 2850 [2025-03-08 06:29:20,630 INFO L226 Difference]: Without dead ends: 2430 [2025-03-08 06:29:20,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:29:20,631 INFO L435 NwaCegarLoop]: 980 mSDtfsCounter, 4889 mSDsluCounter, 5161 mSDsCounter, 0 mSdLazyCounter, 5138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4889 SdHoareTripleChecker+Valid, 6141 SdHoareTripleChecker+Invalid, 5149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:20,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4889 Valid, 6141 Invalid, 5149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5138 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:29:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2025-03-08 06:29:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1549. [2025-03-08 06:29:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1520 states have (on average 1.4414473684210527) internal successors, (2191), 1548 states have internal predecessors, (2191), 0 states have call successors, (0), 0 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-08 06:29:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2191 transitions. [2025-03-08 06:29:20,657 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2191 transitions. Word has length 109 [2025-03-08 06:29:20,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:20,658 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2191 transitions. [2025-03-08 06:29:20,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 11 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2191 transitions. [2025-03-08 06:29:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:20,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:20,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:20,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:29:20,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:20,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash -2014383047, now seen corresponding path program 1 times [2025-03-08 06:29:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:20,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161339672] [2025-03-08 06:29:20,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:20,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:20,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:20,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:20,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:21,026 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-08 06:29:21,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:21,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161339672] [2025-03-08 06:29:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161339672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:21,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:21,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630947123] [2025-03-08 06:29:21,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:21,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:21,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:21,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:21,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:21,027 INFO L87 Difference]: Start difference. First operand 1549 states and 2191 transitions. Second operand has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 11 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:22,668 INFO L93 Difference]: Finished difference Result 2698 states and 3819 transitions. [2025-03-08 06:29:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:22,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 11 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:22,673 INFO L225 Difference]: With dead ends: 2698 [2025-03-08 06:29:22,673 INFO L226 Difference]: Without dead ends: 2418 [2025-03-08 06:29:22,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:29:22,675 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 5116 mSDsluCounter, 3968 mSDsCounter, 0 mSdLazyCounter, 4057 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 4885 SdHoareTripleChecker+Invalid, 4071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:22,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 4885 Invalid, 4071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4057 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:29:22,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2025-03-08 06:29:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1557. [2025-03-08 06:29:22,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1528 states have (on average 1.4417539267015707) internal successors, (2203), 1556 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2203 transitions. [2025-03-08 06:29:22,694 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2203 transitions. Word has length 109 [2025-03-08 06:29:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:22,695 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2203 transitions. [2025-03-08 06:29:22,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.083333333333334) internal successors, (109), 11 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2203 transitions. [2025-03-08 06:29:22,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:22,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:22,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:22,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:29:22,697 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:22,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:22,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1711660744, now seen corresponding path program 1 times [2025-03-08 06:29:22,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:22,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075738952] [2025-03-08 06:29:22,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:22,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:22,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:22,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:22,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:22,980 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-08 06:29:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075738952] [2025-03-08 06:29:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075738952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:22,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:22,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898870524] [2025-03-08 06:29:22,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:22,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:22,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:22,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:22,982 INFO L87 Difference]: Start difference. First operand 1557 states and 2203 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:24,216 INFO L93 Difference]: Finished difference Result 2366 states and 3362 transitions. [2025-03-08 06:29:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:29:24,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:24,220 INFO L225 Difference]: With dead ends: 2366 [2025-03-08 06:29:24,221 INFO L226 Difference]: Without dead ends: 1716 [2025-03-08 06:29:24,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:29:24,222 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 3350 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 3427 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3350 SdHoareTripleChecker+Valid, 4175 SdHoareTripleChecker+Invalid, 3434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:24,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3350 Valid, 4175 Invalid, 3434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3427 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2025-03-08 06:29:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1543. [2025-03-08 06:29:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4418758256274768) internal successors, (2183), 1542 states have internal predecessors, (2183), 0 states have call successors, (0), 0 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-08 06:29:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2183 transitions. [2025-03-08 06:29:24,238 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2183 transitions. Word has length 109 [2025-03-08 06:29:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:24,239 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2183 transitions. [2025-03-08 06:29:24,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2183 transitions. [2025-03-08 06:29:24,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:24,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:24,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:24,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:29:24,241 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:24,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:24,241 INFO L85 PathProgramCache]: Analyzing trace with hash 108052829, now seen corresponding path program 1 times [2025-03-08 06:29:24,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:24,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851077031] [2025-03-08 06:29:24,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:24,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:24,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:24,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:24,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:24,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851077031] [2025-03-08 06:29:24,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851077031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:24,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:24,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:24,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879009141] [2025-03-08 06:29:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:24,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:24,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:24,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:24,516 INFO L87 Difference]: Start difference. First operand 1543 states and 2183 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:26,291 INFO L93 Difference]: Finished difference Result 2784 states and 3957 transitions. [2025-03-08 06:29:26,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:26,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:26,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:26,297 INFO L225 Difference]: With dead ends: 2784 [2025-03-08 06:29:26,297 INFO L226 Difference]: Without dead ends: 2418 [2025-03-08 06:29:26,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:26,299 INFO L435 NwaCegarLoop]: 1240 mSDtfsCounter, 5939 mSDsluCounter, 4977 mSDsCounter, 0 mSdLazyCounter, 4982 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5939 SdHoareTripleChecker+Valid, 6217 SdHoareTripleChecker+Invalid, 4988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:26,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5939 Valid, 6217 Invalid, 4988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4982 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:29:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2025-03-08 06:29:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1543. [2025-03-08 06:29:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.440554821664465) internal successors, (2181), 1542 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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-08 06:29:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2181 transitions. [2025-03-08 06:29:26,318 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2181 transitions. Word has length 109 [2025-03-08 06:29:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:26,318 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2181 transitions. [2025-03-08 06:29:26,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2181 transitions. [2025-03-08 06:29:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:26,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:26,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:26,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:29:26,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:26,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:26,323 INFO L85 PathProgramCache]: Analyzing trace with hash 545727482, now seen corresponding path program 1 times [2025-03-08 06:29:26,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:26,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103397394] [2025-03-08 06:29:26,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:26,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:26,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:26,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:26,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:26,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:26,579 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-08 06:29:26,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103397394] [2025-03-08 06:29:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103397394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:26,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277430909] [2025-03-08 06:29:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:26,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:26,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:26,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:26,582 INFO L87 Difference]: Start difference. First operand 1543 states and 2181 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:27,813 INFO L93 Difference]: Finished difference Result 2644 states and 3752 transitions. [2025-03-08 06:29:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:27,818 INFO L225 Difference]: With dead ends: 2644 [2025-03-08 06:29:27,818 INFO L226 Difference]: Without dead ends: 2386 [2025-03-08 06:29:27,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:27,820 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 5086 mSDsluCounter, 3442 mSDsCounter, 0 mSdLazyCounter, 3580 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5086 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:27,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5086 Valid, 4333 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3580 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-08 06:29:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1543. [2025-03-08 06:29:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4392338177014532) internal successors, (2179), 1542 states have internal predecessors, (2179), 0 states have call successors, (0), 0 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-08 06:29:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2179 transitions. [2025-03-08 06:29:27,837 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2179 transitions. Word has length 109 [2025-03-08 06:29:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:27,837 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2179 transitions. [2025-03-08 06:29:27,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2179 transitions. [2025-03-08 06:29:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:27,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:27,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:27,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:29:27,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:27,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1388087392, now seen corresponding path program 1 times [2025-03-08 06:29:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:27,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530287734] [2025-03-08 06:29:27,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:27,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:27,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:27,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:27,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530287734] [2025-03-08 06:29:28,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530287734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:28,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:28,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:28,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280005422] [2025-03-08 06:29:28,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:28,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:28,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:28,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:28,089 INFO L87 Difference]: Start difference. First operand 1543 states and 2179 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:29,658 INFO L93 Difference]: Finished difference Result 2702 states and 3833 transitions. [2025-03-08 06:29:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:29,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:29,664 INFO L225 Difference]: With dead ends: 2702 [2025-03-08 06:29:29,664 INFO L226 Difference]: Without dead ends: 2418 [2025-03-08 06:29:29,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:29,666 INFO L435 NwaCegarLoop]: 1238 mSDtfsCounter, 4475 mSDsluCounter, 4964 mSDsCounter, 0 mSdLazyCounter, 4979 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 6202 SdHoareTripleChecker+Invalid, 4984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:29,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 6202 Invalid, 4984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4979 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:29:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2025-03-08 06:29:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1543. [2025-03-08 06:29:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4385733157199472) internal successors, (2178), 1542 states have internal predecessors, (2178), 0 states have call successors, (0), 0 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-08 06:29:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2178 transitions. [2025-03-08 06:29:29,679 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2178 transitions. Word has length 109 [2025-03-08 06:29:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2178 transitions. [2025-03-08 06:29:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2178 transitions. [2025-03-08 06:29:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:29,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:29,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:29,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:29:29,681 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -950412739, now seen corresponding path program 1 times [2025-03-08 06:29:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230203797] [2025-03-08 06:29:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:29,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:29,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:29,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:29,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:29,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230203797] [2025-03-08 06:29:29,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230203797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:29,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:29,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076423170] [2025-03-08 06:29:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:29,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:29,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:29,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:29,879 INFO L87 Difference]: Start difference. First operand 1543 states and 2178 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:31,046 INFO L93 Difference]: Finished difference Result 2396 states and 3337 transitions. [2025-03-08 06:29:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:31,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:31,050 INFO L225 Difference]: With dead ends: 2396 [2025-03-08 06:29:31,050 INFO L226 Difference]: Without dead ends: 2225 [2025-03-08 06:29:31,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:31,051 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 7957 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7957 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:31,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7957 Valid, 3132 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2025-03-08 06:29:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 1543. [2025-03-08 06:29:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4379128137384412) internal successors, (2177), 1542 states have internal predecessors, (2177), 0 states have call successors, (0), 0 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-08 06:29:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2177 transitions. [2025-03-08 06:29:31,063 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2177 transitions. Word has length 109 [2025-03-08 06:29:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:31,063 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2177 transitions. [2025-03-08 06:29:31,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2177 transitions. [2025-03-08 06:29:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:31,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:31,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:31,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:29:31,065 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:31,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:31,065 INFO L85 PathProgramCache]: Analyzing trace with hash 619083870, now seen corresponding path program 1 times [2025-03-08 06:29:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:31,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643603338] [2025-03-08 06:29:31,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:31,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:31,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:31,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:31,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:31,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:31,287 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-08 06:29:31,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643603338] [2025-03-08 06:29:31,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643603338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:31,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:31,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807577222] [2025-03-08 06:29:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:31,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:31,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:31,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:31,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:31,289 INFO L87 Difference]: Start difference. First operand 1543 states and 2177 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:32,649 INFO L93 Difference]: Finished difference Result 2679 states and 3805 transitions. [2025-03-08 06:29:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:32,649 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:32,652 INFO L225 Difference]: With dead ends: 2679 [2025-03-08 06:29:32,652 INFO L226 Difference]: Without dead ends: 2418 [2025-03-08 06:29:32,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:32,653 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 4564 mSDsluCounter, 4379 mSDsCounter, 0 mSdLazyCounter, 4425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4564 SdHoareTripleChecker+Valid, 5569 SdHoareTripleChecker+Invalid, 4431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:32,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4564 Valid, 5569 Invalid, 4431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4425 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2025-03-08 06:29:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1543. [2025-03-08 06:29:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4372523117569354) internal successors, (2176), 1542 states have internal predecessors, (2176), 0 states have call successors, (0), 0 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-08 06:29:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2176 transitions. [2025-03-08 06:29:32,665 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2176 transitions. Word has length 109 [2025-03-08 06:29:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:32,665 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2176 transitions. [2025-03-08 06:29:32,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2176 transitions. [2025-03-08 06:29:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 06:29:32,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:32,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:32,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:29:32,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:32,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:32,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1367644336, now seen corresponding path program 1 times [2025-03-08 06:29:32,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:32,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515068126] [2025-03-08 06:29:32,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:32,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 06:29:32,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 06:29:32,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:32,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:32,850 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-08 06:29:32,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:32,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515068126] [2025-03-08 06:29:32,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515068126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:32,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:32,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:32,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380678762] [2025-03-08 06:29:32,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:32,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:32,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:32,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:32,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:32,851 INFO L87 Difference]: Start difference. First operand 1543 states and 2176 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:33,976 INFO L93 Difference]: Finished difference Result 2488 states and 3498 transitions. [2025-03-08 06:29:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:33,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-08 06:29:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:33,979 INFO L225 Difference]: With dead ends: 2488 [2025-03-08 06:29:33,979 INFO L226 Difference]: Without dead ends: 2314 [2025-03-08 06:29:33,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:33,980 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 5990 mSDsluCounter, 2585 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5990 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:33,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5990 Valid, 3367 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-03-08 06:29:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1543. [2025-03-08 06:29:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4365918097754293) internal successors, (2175), 1542 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2175 transitions. [2025-03-08 06:29:33,993 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2175 transitions. Word has length 109 [2025-03-08 06:29:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:33,993 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2175 transitions. [2025-03-08 06:29:33,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-08 06:29:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2175 transitions. [2025-03-08 06:29:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:33,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:33,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:33,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:29:33,995 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:33,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash 233554192, now seen corresponding path program 1 times [2025-03-08 06:29:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:33,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736451467] [2025-03-08 06:29:33,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:34,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:34,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:34,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:34,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:34,184 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-08 06:29:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736451467] [2025-03-08 06:29:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736451467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162880202] [2025-03-08 06:29:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:34,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:34,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:34,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:34,185 INFO L87 Difference]: Start difference. First operand 1543 states and 2175 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:35,563 INFO L93 Difference]: Finished difference Result 2838 states and 4011 transitions. [2025-03-08 06:29:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:35,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:35,567 INFO L225 Difference]: With dead ends: 2838 [2025-03-08 06:29:35,567 INFO L226 Difference]: Without dead ends: 2418 [2025-03-08 06:29:35,568 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-08 06:29:35,568 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 3004 mSDsluCounter, 4046 mSDsCounter, 0 mSdLazyCounter, 4276 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3004 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:35,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3004 Valid, 5279 Invalid, 4281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4276 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2025-03-08 06:29:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1543. [2025-03-08 06:29:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4352708058124175) internal successors, (2173), 1542 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2173 transitions. [2025-03-08 06:29:35,581 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2173 transitions. Word has length 111 [2025-03-08 06:29:35,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:35,581 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2173 transitions. [2025-03-08 06:29:35,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2173 transitions. [2025-03-08 06:29:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:35,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:35,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:35,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:29:35,583 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:35,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash -8045959, now seen corresponding path program 1 times [2025-03-08 06:29:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:35,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032299153] [2025-03-08 06:29:35,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:35,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:35,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:35,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:35,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:35,830 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-08 06:29:35,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:35,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032299153] [2025-03-08 06:29:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032299153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:35,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134284569] [2025-03-08 06:29:35,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:35,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:35,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:35,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:35,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:35,832 INFO L87 Difference]: Start difference. First operand 1543 states and 2173 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:37,245 INFO L93 Difference]: Finished difference Result 2666 states and 3769 transitions. [2025-03-08 06:29:37,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:37,250 INFO L225 Difference]: With dead ends: 2666 [2025-03-08 06:29:37,250 INFO L226 Difference]: Without dead ends: 2386 [2025-03-08 06:29:37,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:37,251 INFO L435 NwaCegarLoop]: 1166 mSDtfsCounter, 6279 mSDsluCounter, 3830 mSDsCounter, 0 mSdLazyCounter, 4067 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6279 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 4074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:37,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6279 Valid, 4996 Invalid, 4074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4067 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-08 06:29:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1543. [2025-03-08 06:29:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4339498018494055) internal successors, (2171), 1542 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2171 transitions. [2025-03-08 06:29:37,268 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2171 transitions. Word has length 111 [2025-03-08 06:29:37,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:37,268 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2171 transitions. [2025-03-08 06:29:37,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2171 transitions. [2025-03-08 06:29:37,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:37,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:37,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:37,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:29:37,270 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:37,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -576969464, now seen corresponding path program 1 times [2025-03-08 06:29:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:37,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592679635] [2025-03-08 06:29:37,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:37,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:37,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:37,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:37,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:37,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:37,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:37,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592679635] [2025-03-08 06:29:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592679635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:37,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:37,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585700271] [2025-03-08 06:29:37,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:37,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:37,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:37,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:37,512 INFO L87 Difference]: Start difference. First operand 1543 states and 2171 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:38,895 INFO L93 Difference]: Finished difference Result 2576 states and 3632 transitions. [2025-03-08 06:29:38,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:38,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:38,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:38,899 INFO L225 Difference]: With dead ends: 2576 [2025-03-08 06:29:38,899 INFO L226 Difference]: Without dead ends: 2362 [2025-03-08 06:29:38,899 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-08 06:29:38,901 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 6522 mSDsluCounter, 3800 mSDsCounter, 0 mSdLazyCounter, 3842 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6522 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 3849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:38,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6522 Valid, 4682 Invalid, 3849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3842 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-03-08 06:29:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1543. [2025-03-08 06:29:38,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4326287978863936) internal successors, (2169), 1542 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2169 transitions. [2025-03-08 06:29:38,916 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2169 transitions. Word has length 111 [2025-03-08 06:29:38,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:38,916 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2169 transitions. [2025-03-08 06:29:38,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2169 transitions. [2025-03-08 06:29:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:38,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:38,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:38,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:29:38,918 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:38,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1858751747, now seen corresponding path program 1 times [2025-03-08 06:29:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676898963] [2025-03-08 06:29:38,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:38,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:38,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:38,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:38,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:39,159 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-08 06:29:39,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:39,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676898963] [2025-03-08 06:29:39,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676898963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:39,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:39,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:39,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785459309] [2025-03-08 06:29:39,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:39,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:39,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:39,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:39,161 INFO L87 Difference]: Start difference. First operand 1543 states and 2169 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:40,628 INFO L93 Difference]: Finished difference Result 2650 states and 3740 transitions. [2025-03-08 06:29:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:40,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:40,632 INFO L225 Difference]: With dead ends: 2650 [2025-03-08 06:29:40,632 INFO L226 Difference]: Without dead ends: 2386 [2025-03-08 06:29:40,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:40,633 INFO L435 NwaCegarLoop]: 1164 mSDtfsCounter, 4566 mSDsluCounter, 4690 mSDsCounter, 0 mSdLazyCounter, 4755 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4566 SdHoareTripleChecker+Valid, 5854 SdHoareTripleChecker+Invalid, 4761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:40,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4566 Valid, 5854 Invalid, 4761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4755 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-08 06:29:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1543. [2025-03-08 06:29:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4313077939233818) internal successors, (2167), 1542 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2167 transitions. [2025-03-08 06:29:40,647 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2167 transitions. Word has length 111 [2025-03-08 06:29:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:40,647 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2167 transitions. [2025-03-08 06:29:40,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2167 transitions. [2025-03-08 06:29:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:40,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:40,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:40,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:29:40,648 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:40,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1867292044, now seen corresponding path program 1 times [2025-03-08 06:29:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:40,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063304160] [2025-03-08 06:29:40,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:40,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:40,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:40,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:40,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:40,825 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-08 06:29:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:40,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063304160] [2025-03-08 06:29:40,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063304160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:40,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:40,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820669355] [2025-03-08 06:29:40,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:40,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:40,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:40,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:40,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:40,826 INFO L87 Difference]: Start difference. First operand 1543 states and 2167 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:41,837 INFO L93 Difference]: Finished difference Result 2230 states and 3074 transitions. [2025-03-08 06:29:41,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:41,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:41,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:41,840 INFO L225 Difference]: With dead ends: 2230 [2025-03-08 06:29:41,840 INFO L226 Difference]: Without dead ends: 2225 [2025-03-08 06:29:41,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:41,841 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 5965 mSDsluCounter, 2390 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5965 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:41,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5965 Valid, 3152 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2025-03-08 06:29:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 1543. [2025-03-08 06:29:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.42998678996037) internal successors, (2165), 1542 states have internal predecessors, (2165), 0 states have call successors, (0), 0 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-08 06:29:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2165 transitions. [2025-03-08 06:29:41,865 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2165 transitions. Word has length 111 [2025-03-08 06:29:41,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:41,865 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2165 transitions. [2025-03-08 06:29:41,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2165 transitions. [2025-03-08 06:29:41,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:41,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:41,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:41,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:29:41,867 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:41,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash 25816026, now seen corresponding path program 1 times [2025-03-08 06:29:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:41,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561829862] [2025-03-08 06:29:41,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:41,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:41,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:41,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:41,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:42,045 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-08 06:29:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561829862] [2025-03-08 06:29:42,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561829862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:42,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:42,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788682238] [2025-03-08 06:29:42,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:42,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:42,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:42,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:42,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:42,047 INFO L87 Difference]: Start difference. First operand 1543 states and 2165 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:43,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:43,263 INFO L93 Difference]: Finished difference Result 2572 states and 3620 transitions. [2025-03-08 06:29:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:43,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:43,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:43,266 INFO L225 Difference]: With dead ends: 2572 [2025-03-08 06:29:43,267 INFO L226 Difference]: Without dead ends: 2362 [2025-03-08 06:29:43,267 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-08 06:29:43,267 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 5492 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5492 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:43,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5492 Valid, 3998 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-03-08 06:29:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1543. [2025-03-08 06:29:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.428665785997358) internal successors, (2163), 1542 states have internal predecessors, (2163), 0 states have call successors, (0), 0 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-08 06:29:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2163 transitions. [2025-03-08 06:29:43,280 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2163 transitions. Word has length 111 [2025-03-08 06:29:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:43,281 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2163 transitions. [2025-03-08 06:29:43,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2163 transitions. [2025-03-08 06:29:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:43,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:43,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:43,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:29:43,283 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:43,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2017541889, now seen corresponding path program 1 times [2025-03-08 06:29:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637863346] [2025-03-08 06:29:43,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:43,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:43,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:43,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:43,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:43,507 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-08 06:29:43,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:43,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637863346] [2025-03-08 06:29:43,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637863346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:43,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:43,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091824209] [2025-03-08 06:29:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:43,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:43,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:43,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:43,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:43,509 INFO L87 Difference]: Start difference. First operand 1543 states and 2163 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:44,874 INFO L93 Difference]: Finished difference Result 2566 states and 3611 transitions. [2025-03-08 06:29:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:44,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:44,877 INFO L225 Difference]: With dead ends: 2566 [2025-03-08 06:29:44,877 INFO L226 Difference]: Without dead ends: 2362 [2025-03-08 06:29:44,878 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-08 06:29:44,878 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 6424 mSDsluCounter, 3935 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6424 SdHoareTripleChecker+Valid, 4862 SdHoareTripleChecker+Invalid, 3970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:44,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6424 Valid, 4862 Invalid, 3970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-03-08 06:29:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1543. [2025-03-08 06:29:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4273447820343461) internal successors, (2161), 1542 states have internal predecessors, (2161), 0 states have call successors, (0), 0 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-08 06:29:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2161 transitions. [2025-03-08 06:29:44,894 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2161 transitions. Word has length 111 [2025-03-08 06:29:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:44,895 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2161 transitions. [2025-03-08 06:29:44,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2161 transitions. [2025-03-08 06:29:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:44,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:44,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:44,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:29:44,897 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:44,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash -835411232, now seen corresponding path program 1 times [2025-03-08 06:29:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:44,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116966690] [2025-03-08 06:29:44,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:44,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:44,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:44,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:44,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:45,245 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-08 06:29:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116966690] [2025-03-08 06:29:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116966690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:45,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182220671] [2025-03-08 06:29:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:45,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:45,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:45,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:45,247 INFO L87 Difference]: Start difference. First operand 1543 states and 2161 transitions. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:47,210 INFO L93 Difference]: Finished difference Result 3256 states and 4631 transitions. [2025-03-08 06:29:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:47,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:47,213 INFO L225 Difference]: With dead ends: 3256 [2025-03-08 06:29:47,213 INFO L226 Difference]: Without dead ends: 3026 [2025-03-08 06:29:47,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:47,214 INFO L435 NwaCegarLoop]: 1205 mSDtfsCounter, 10138 mSDsluCounter, 4341 mSDsCounter, 0 mSdLazyCounter, 4623 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10138 SdHoareTripleChecker+Valid, 5546 SdHoareTripleChecker+Invalid, 4924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 4623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:47,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10138 Valid, 5546 Invalid, 4924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 4623 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 06:29:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2025-03-08 06:29:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1547. [2025-03-08 06:29:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.4262187088274045) internal successors, (2165), 1546 states have internal predecessors, (2165), 0 states have call successors, (0), 0 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-08 06:29:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2165 transitions. [2025-03-08 06:29:47,230 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2165 transitions. Word has length 111 [2025-03-08 06:29:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:47,230 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2165 transitions. [2025-03-08 06:29:47,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 11 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2165 transitions. [2025-03-08 06:29:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:47,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:47,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:47,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:29:47,232 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:47,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1404334737, now seen corresponding path program 1 times [2025-03-08 06:29:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:47,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091247913] [2025-03-08 06:29:47,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:47,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:47,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:47,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:47,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:47,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:47,481 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-08 06:29:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091247913] [2025-03-08 06:29:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091247913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:47,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:47,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162116256] [2025-03-08 06:29:47,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:47,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:47,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:47,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:47,482 INFO L87 Difference]: Start difference. First operand 1547 states and 2165 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:48,790 INFO L93 Difference]: Finished difference Result 2557 states and 3591 transitions. [2025-03-08 06:29:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:48,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:48,793 INFO L225 Difference]: With dead ends: 2557 [2025-03-08 06:29:48,793 INFO L226 Difference]: Without dead ends: 2366 [2025-03-08 06:29:48,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:48,794 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 6419 mSDsluCounter, 3935 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6419 SdHoareTripleChecker+Valid, 4862 SdHoareTripleChecker+Invalid, 3966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:48,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6419 Valid, 4862 Invalid, 3966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2025-03-08 06:29:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1547. [2025-03-08 06:29:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.4255599472990776) internal successors, (2164), 1546 states have internal predecessors, (2164), 0 states have call successors, (0), 0 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-08 06:29:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2164 transitions. [2025-03-08 06:29:48,808 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2164 transitions. Word has length 111 [2025-03-08 06:29:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:48,808 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2164 transitions. [2025-03-08 06:29:48,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2164 transitions. [2025-03-08 06:29:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:48,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:48,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:48,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:29:48,810 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:48,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1865859491, now seen corresponding path program 1 times [2025-03-08 06:29:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:48,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872007740] [2025-03-08 06:29:48,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:48,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:48,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:48,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:48,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:49,005 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-08 06:29:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872007740] [2025-03-08 06:29:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872007740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:49,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:49,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397828783] [2025-03-08 06:29:49,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:49,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:49,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:49,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:49,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:49,006 INFO L87 Difference]: Start difference. First operand 1547 states and 2164 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:50,268 INFO L93 Difference]: Finished difference Result 2601 states and 3661 transitions. [2025-03-08 06:29:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:50,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:50,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:50,271 INFO L225 Difference]: With dead ends: 2601 [2025-03-08 06:29:50,271 INFO L226 Difference]: Without dead ends: 2386 [2025-03-08 06:29:50,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:50,272 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 3188 mSDsluCounter, 3683 mSDsCounter, 0 mSdLazyCounter, 3879 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3188 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 3885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:50,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3188 Valid, 4800 Invalid, 3885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3879 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-08 06:29:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1547. [2025-03-08 06:29:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.424901185770751) internal successors, (2163), 1546 states have internal predecessors, (2163), 0 states have call successors, (0), 0 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-08 06:29:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2163 transitions. [2025-03-08 06:29:50,286 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2163 transitions. Word has length 111 [2025-03-08 06:29:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:50,287 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2163 transitions. [2025-03-08 06:29:50,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2163 transitions. [2025-03-08 06:29:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:50,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:50,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:50,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:29:50,288 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:50,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:50,289 INFO L85 PathProgramCache]: Analyzing trace with hash -994790192, now seen corresponding path program 1 times [2025-03-08 06:29:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:50,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70336408] [2025-03-08 06:29:50,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:50,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:50,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:50,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:50,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:50,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:50,482 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-08 06:29:50,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:50,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70336408] [2025-03-08 06:29:50,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70336408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:50,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:50,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072219071] [2025-03-08 06:29:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:50,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:50,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:50,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:50,484 INFO L87 Difference]: Start difference. First operand 1547 states and 2163 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:51,621 INFO L93 Difference]: Finished difference Result 2492 states and 3482 transitions. [2025-03-08 06:29:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:51,624 INFO L225 Difference]: With dead ends: 2492 [2025-03-08 06:29:51,624 INFO L226 Difference]: Without dead ends: 2318 [2025-03-08 06:29:51,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:51,625 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 3707 mSDsluCounter, 2792 mSDsCounter, 0 mSdLazyCounter, 3094 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3707 SdHoareTripleChecker+Valid, 3643 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:51,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3707 Valid, 3643 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3094 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-03-08 06:29:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1547. [2025-03-08 06:29:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.4242424242424243) internal successors, (2162), 1546 states have internal predecessors, (2162), 0 states have call successors, (0), 0 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-08 06:29:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2162 transitions. [2025-03-08 06:29:51,637 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2162 transitions. Word has length 111 [2025-03-08 06:29:51,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:51,637 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2162 transitions. [2025-03-08 06:29:51,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2162 transitions. [2025-03-08 06:29:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:51,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:51,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:51,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:29:51,639 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:51,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1330411792, now seen corresponding path program 1 times [2025-03-08 06:29:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:51,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406676867] [2025-03-08 06:29:51,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:51,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:51,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:51,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:51,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:51,841 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-08 06:29:51,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406676867] [2025-03-08 06:29:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406676867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:51,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:51,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:51,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143092706] [2025-03-08 06:29:51,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:51,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:51,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:51,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:51,842 INFO L87 Difference]: Start difference. First operand 1547 states and 2162 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:53,132 INFO L93 Difference]: Finished difference Result 2593 states and 3651 transitions. [2025-03-08 06:29:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:53,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:53,135 INFO L225 Difference]: With dead ends: 2593 [2025-03-08 06:29:53,135 INFO L226 Difference]: Without dead ends: 2386 [2025-03-08 06:29:53,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:53,136 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 6497 mSDsluCounter, 3683 mSDsCounter, 0 mSdLazyCounter, 3871 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6497 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 3878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:53,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6497 Valid, 4800 Invalid, 3878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3871 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-08 06:29:53,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1547. [2025-03-08 06:29:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.4235836627140974) internal successors, (2161), 1546 states have internal predecessors, (2161), 0 states have call successors, (0), 0 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-08 06:29:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2161 transitions. [2025-03-08 06:29:53,149 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2161 transitions. Word has length 111 [2025-03-08 06:29:53,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:53,149 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2161 transitions. [2025-03-08 06:29:53,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2161 transitions. [2025-03-08 06:29:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:53,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:53,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:53,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:29:53,152 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:53,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1523977524, now seen corresponding path program 1 times [2025-03-08 06:29:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:53,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427724939] [2025-03-08 06:29:53,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:53,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:53,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:53,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:53,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:53,335 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-08 06:29:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427724939] [2025-03-08 06:29:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427724939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:53,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682923040] [2025-03-08 06:29:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:53,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:53,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:53,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:53,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:53,337 INFO L87 Difference]: Start difference. First operand 1547 states and 2161 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:54,503 INFO L93 Difference]: Finished difference Result 2549 states and 3579 transitions. [2025-03-08 06:29:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:54,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:54,505 INFO L225 Difference]: With dead ends: 2549 [2025-03-08 06:29:54,505 INFO L226 Difference]: Without dead ends: 2366 [2025-03-08 06:29:54,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:54,506 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 5967 mSDsluCounter, 3296 mSDsCounter, 0 mSdLazyCounter, 3522 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5967 SdHoareTripleChecker+Valid, 4293 SdHoareTripleChecker+Invalid, 3529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:54,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5967 Valid, 4293 Invalid, 3529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3522 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2025-03-08 06:29:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1547. [2025-03-08 06:29:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.4229249011857708) internal successors, (2160), 1546 states have internal predecessors, (2160), 0 states have call successors, (0), 0 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-08 06:29:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2160 transitions. [2025-03-08 06:29:54,520 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2160 transitions. Word has length 111 [2025-03-08 06:29:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:54,520 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2160 transitions. [2025-03-08 06:29:54,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2160 transitions. [2025-03-08 06:29:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:54,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:54,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:54,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:29:54,522 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:54,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1843613698, now seen corresponding path program 1 times [2025-03-08 06:29:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66147334] [2025-03-08 06:29:54,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:54,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:54,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:54,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:54,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:54,702 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-08 06:29:54,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:54,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66147334] [2025-03-08 06:29:54,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66147334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:54,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:54,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:54,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790438529] [2025-03-08 06:29:54,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:54,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:54,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:54,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:54,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:54,703 INFO L87 Difference]: Start difference. First operand 1547 states and 2160 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:55,852 INFO L93 Difference]: Finished difference Result 2557 states and 3584 transitions. [2025-03-08 06:29:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:55,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:55,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:55,854 INFO L225 Difference]: With dead ends: 2557 [2025-03-08 06:29:55,854 INFO L226 Difference]: Without dead ends: 2366 [2025-03-08 06:29:55,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:55,855 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 3401 mSDsluCounter, 3293 mSDsCounter, 0 mSdLazyCounter, 3520 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3401 SdHoareTripleChecker+Valid, 4290 SdHoareTripleChecker+Invalid, 3526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:55,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3401 Valid, 4290 Invalid, 3526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3520 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2025-03-08 06:29:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1547. [2025-03-08 06:29:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.422266139657444) internal successors, (2159), 1546 states have internal predecessors, (2159), 0 states have call successors, (0), 0 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-08 06:29:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2159 transitions. [2025-03-08 06:29:55,867 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2159 transitions. Word has length 111 [2025-03-08 06:29:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:55,867 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2159 transitions. [2025-03-08 06:29:55,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2159 transitions. [2025-03-08 06:29:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:55,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:55,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:55,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:29:55,869 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:55,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash -417569334, now seen corresponding path program 1 times [2025-03-08 06:29:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381131778] [2025-03-08 06:29:55,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:55,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:55,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:55,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:55,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:56,077 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-08 06:29:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381131778] [2025-03-08 06:29:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381131778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:56,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:56,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517558649] [2025-03-08 06:29:56,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:56,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:56,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:56,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:56,079 INFO L87 Difference]: Start difference. First operand 1547 states and 2159 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:57,417 INFO L93 Difference]: Finished difference Result 2601 states and 3653 transitions. [2025-03-08 06:29:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:57,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:57,419 INFO L225 Difference]: With dead ends: 2601 [2025-03-08 06:29:57,419 INFO L226 Difference]: Without dead ends: 2386 [2025-03-08 06:29:57,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:57,420 INFO L435 NwaCegarLoop]: 1170 mSDtfsCounter, 4523 mSDsluCounter, 4274 mSDsCounter, 0 mSdLazyCounter, 4370 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4523 SdHoareTripleChecker+Valid, 5444 SdHoareTripleChecker+Invalid, 4375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:57,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4523 Valid, 5444 Invalid, 4375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4370 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-08 06:29:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1547. [2025-03-08 06:29:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.4216073781291172) internal successors, (2158), 1546 states have internal predecessors, (2158), 0 states have call successors, (0), 0 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-08 06:29:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2158 transitions. [2025-03-08 06:29:57,432 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2158 transitions. Word has length 111 [2025-03-08 06:29:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:57,432 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2158 transitions. [2025-03-08 06:29:57,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2158 transitions. [2025-03-08 06:29:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:29:57,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:57,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:57,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:29:57,434 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:57,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:57,434 INFO L85 PathProgramCache]: Analyzing trace with hash 524031176, now seen corresponding path program 1 times [2025-03-08 06:29:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:57,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577074412] [2025-03-08 06:29:57,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:57,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:29:57,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:29:57,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:57,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577074412] [2025-03-08 06:29:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577074412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:57,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:57,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:57,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743756316] [2025-03-08 06:29:57,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:57,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:57,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:57,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:57,640 INFO L87 Difference]: Start difference. First operand 1547 states and 2158 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:58,985 INFO L93 Difference]: Finished difference Result 2551 states and 3577 transitions. [2025-03-08 06:29:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:58,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-08 06:29:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:58,987 INFO L225 Difference]: With dead ends: 2551 [2025-03-08 06:29:58,987 INFO L226 Difference]: Without dead ends: 2366 [2025-03-08 06:29:58,987 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-08 06:29:58,988 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 6188 mSDsluCounter, 4250 mSDsCounter, 0 mSdLazyCounter, 4296 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6188 SdHoareTripleChecker+Valid, 5282 SdHoareTripleChecker+Invalid, 4303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:58,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6188 Valid, 5282 Invalid, 4303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4296 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2025-03-08 06:29:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 1547. [2025-03-08 06:29:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1518 states have (on average 1.4209486166007905) internal successors, (2157), 1546 states have internal predecessors, (2157), 0 states have call successors, (0), 0 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-08 06:29:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2157 transitions. [2025-03-08 06:29:59,001 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 2157 transitions. Word has length 111 [2025-03-08 06:29:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:59,001 INFO L471 AbstractCegarLoop]: Abstraction has 1547 states and 2157 transitions. [2025-03-08 06:29:59,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2157 transitions. [2025-03-08 06:29:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:59,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:59,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:59,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:29:59,003 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:59,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1710425095, now seen corresponding path program 1 times [2025-03-08 06:29:59,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:59,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369866458] [2025-03-08 06:29:59,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:59,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:59,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:59,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:59,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:59,197 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-08 06:29:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:59,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369866458] [2025-03-08 06:29:59,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369866458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:59,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:59,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:59,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918493702] [2025-03-08 06:29:59,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:59,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:59,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:59,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:59,201 INFO L87 Difference]: Start difference. First operand 1547 states and 2157 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:00,512 INFO L93 Difference]: Finished difference Result 2616 states and 3666 transitions. [2025-03-08 06:30:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:00,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:30:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:00,514 INFO L225 Difference]: With dead ends: 2616 [2025-03-08 06:30:00,514 INFO L226 Difference]: Without dead ends: 2386 [2025-03-08 06:30:00,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:30:00,515 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 6222 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 3988 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6222 SdHoareTripleChecker+Valid, 4981 SdHoareTripleChecker+Invalid, 3995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:00,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6222 Valid, 4981 Invalid, 3995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3988 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:00,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-08 06:30:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1543. [2025-03-08 06:30:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4214002642007926) internal successors, (2152), 1542 states have internal predecessors, (2152), 0 states have call successors, (0), 0 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-08 06:30:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2152 transitions. [2025-03-08 06:30:00,528 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2152 transitions. Word has length 112 [2025-03-08 06:30:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:00,528 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2152 transitions. [2025-03-08 06:30:00,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2152 transitions. [2025-03-08 06:30:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:00,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:00,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:00,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:30:00,530 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:00,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash 292283240, now seen corresponding path program 1 times [2025-03-08 06:30:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985356426] [2025-03-08 06:30:00,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:00,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:00,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:00,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:00,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985356426] [2025-03-08 06:30:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985356426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:00,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:00,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309642232] [2025-03-08 06:30:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:00,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:00,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:00,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:00,720 INFO L87 Difference]: Start difference. First operand 1543 states and 2152 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:01,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:01,860 INFO L93 Difference]: Finished difference Result 2502 states and 3488 transitions. [2025-03-08 06:30:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:01,862 INFO L225 Difference]: With dead ends: 2502 [2025-03-08 06:30:01,862 INFO L226 Difference]: Without dead ends: 2314 [2025-03-08 06:30:01,863 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-08 06:30:01,863 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 5478 mSDsluCounter, 2918 mSDsCounter, 0 mSdLazyCounter, 3233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5478 SdHoareTripleChecker+Valid, 3811 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:01,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5478 Valid, 3811 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3233 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:30:01,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-03-08 06:30:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1543. [2025-03-08 06:30:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4200792602377807) internal successors, (2150), 1542 states have internal predecessors, (2150), 0 states have call successors, (0), 0 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-08 06:30:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2150 transitions. [2025-03-08 06:30:01,874 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2150 transitions. Word has length 113 [2025-03-08 06:30:01,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:01,874 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2150 transitions. [2025-03-08 06:30:01,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2150 transitions. [2025-03-08 06:30:01,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:01,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:01,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:01,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:30:01,876 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:01,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:01,876 INFO L85 PathProgramCache]: Analyzing trace with hash 461333509, now seen corresponding path program 1 times [2025-03-08 06:30:01,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:01,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93009994] [2025-03-08 06:30:01,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:01,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:01,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:01,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:01,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:01,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:02,051 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-08 06:30:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93009994] [2025-03-08 06:30:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93009994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:02,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:02,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:02,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640285853] [2025-03-08 06:30:02,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:02,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:02,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:02,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:02,052 INFO L87 Difference]: Start difference. First operand 1543 states and 2150 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:03,252 INFO L93 Difference]: Finished difference Result 2496 states and 3477 transitions. [2025-03-08 06:30:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:03,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:03,255 INFO L225 Difference]: With dead ends: 2496 [2025-03-08 06:30:03,255 INFO L226 Difference]: Without dead ends: 2314 [2025-03-08 06:30:03,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:03,256 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 3594 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 3217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3594 SdHoareTripleChecker+Valid, 3826 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:03,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3594 Valid, 3826 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3217 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-03-08 06:30:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1543. [2025-03-08 06:30:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.418758256274769) internal successors, (2148), 1542 states have internal predecessors, (2148), 0 states have call successors, (0), 0 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-08 06:30:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2148 transitions. [2025-03-08 06:30:03,273 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2148 transitions. Word has length 113 [2025-03-08 06:30:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:03,273 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2148 transitions. [2025-03-08 06:30:03,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2148 transitions. [2025-03-08 06:30:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:03,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:03,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:03,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:30:03,275 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:03,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash 270372633, now seen corresponding path program 1 times [2025-03-08 06:30:03,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:03,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079684442] [2025-03-08 06:30:03,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:03,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:03,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:03,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:03,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:03,461 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-08 06:30:03,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:03,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079684442] [2025-03-08 06:30:03,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079684442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:03,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:03,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:03,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437043740] [2025-03-08 06:30:03,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:03,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:03,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:03,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:03,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:03,462 INFO L87 Difference]: Start difference. First operand 1543 states and 2148 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:04,728 INFO L93 Difference]: Finished difference Result 2584 states and 3614 transitions. [2025-03-08 06:30:04,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:04,730 INFO L225 Difference]: With dead ends: 2584 [2025-03-08 06:30:04,730 INFO L226 Difference]: Without dead ends: 2362 [2025-03-08 06:30:04,731 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-08 06:30:04,731 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 6200 mSDsluCounter, 3675 mSDsCounter, 0 mSdLazyCounter, 3961 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6200 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:04,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6200 Valid, 4800 Invalid, 3967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:04,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-03-08 06:30:04,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1543. [2025-03-08 06:30:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4174372523117569) internal successors, (2146), 1542 states have internal predecessors, (2146), 0 states have call successors, (0), 0 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-08 06:30:04,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2146 transitions. [2025-03-08 06:30:04,743 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2146 transitions. Word has length 113 [2025-03-08 06:30:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:04,744 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2146 transitions. [2025-03-08 06:30:04,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2146 transitions. [2025-03-08 06:30:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:04,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:04,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:04,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:30:04,745 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:04,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:04,745 INFO L85 PathProgramCache]: Analyzing trace with hash 496793830, now seen corresponding path program 1 times [2025-03-08 06:30:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:04,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908234928] [2025-03-08 06:30:04,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:04,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:04,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:04,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:04,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:04,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:04,942 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-08 06:30:04,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:04,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908234928] [2025-03-08 06:30:04,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908234928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:04,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:04,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:04,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102762349] [2025-03-08 06:30:04,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:04,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:04,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:04,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:04,943 INFO L87 Difference]: Start difference. First operand 1543 states and 2146 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:06,209 INFO L93 Difference]: Finished difference Result 2502 states and 3480 transitions. [2025-03-08 06:30:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:06,211 INFO L225 Difference]: With dead ends: 2502 [2025-03-08 06:30:06,211 INFO L226 Difference]: Without dead ends: 2314 [2025-03-08 06:30:06,211 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-08 06:30:06,211 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 6377 mSDsluCounter, 3809 mSDsCounter, 0 mSdLazyCounter, 3882 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6377 SdHoareTripleChecker+Valid, 4731 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:06,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6377 Valid, 4731 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3882 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-03-08 06:30:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1543. [2025-03-08 06:30:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.416116248348745) internal successors, (2144), 1542 states have internal predecessors, (2144), 0 states have call successors, (0), 0 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-08 06:30:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2144 transitions. [2025-03-08 06:30:06,223 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2144 transitions. Word has length 113 [2025-03-08 06:30:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2144 transitions. [2025-03-08 06:30:06,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2144 transitions. [2025-03-08 06:30:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:06,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:06,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:06,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:30:06,225 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:06,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1790839024, now seen corresponding path program 1 times [2025-03-08 06:30:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680300512] [2025-03-08 06:30:06,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:06,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:06,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:06,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:06,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:06,399 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-08 06:30:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680300512] [2025-03-08 06:30:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680300512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:06,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:06,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:06,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614134569] [2025-03-08 06:30:06,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:06,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:06,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:06,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:06,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:06,400 INFO L87 Difference]: Start difference. First operand 1543 states and 2144 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:07,684 INFO L93 Difference]: Finished difference Result 2682 states and 3745 transitions. [2025-03-08 06:30:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:07,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:07,687 INFO L225 Difference]: With dead ends: 2682 [2025-03-08 06:30:07,687 INFO L226 Difference]: Without dead ends: 2386 [2025-03-08 06:30:07,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:07,687 INFO L435 NwaCegarLoop]: 1219 mSDtfsCounter, 5791 mSDsluCounter, 3986 mSDsCounter, 0 mSdLazyCounter, 4134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5791 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 4140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:07,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5791 Valid, 5205 Invalid, 4140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4134 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-08 06:30:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 1543. [2025-03-08 06:30:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4147952443857332) internal successors, (2142), 1542 states have internal predecessors, (2142), 0 states have call successors, (0), 0 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-08 06:30:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2142 transitions. [2025-03-08 06:30:07,699 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2142 transitions. Word has length 113 [2025-03-08 06:30:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:07,699 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2142 transitions. [2025-03-08 06:30:07,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2142 transitions. [2025-03-08 06:30:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:07,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:07,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:07,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:30:07,701 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:07,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:07,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2084234455, now seen corresponding path program 1 times [2025-03-08 06:30:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:07,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109689191] [2025-03-08 06:30:07,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:07,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:07,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:07,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:07,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:07,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:07,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:07,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109689191] [2025-03-08 06:30:07,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109689191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:07,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:07,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:07,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080811531] [2025-03-08 06:30:07,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:07,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:07,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:07,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:07,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:07,906 INFO L87 Difference]: Start difference. First operand 1543 states and 2142 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:09,291 INFO L93 Difference]: Finished difference Result 2584 states and 3604 transitions. [2025-03-08 06:30:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:09,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:09,294 INFO L225 Difference]: With dead ends: 2584 [2025-03-08 06:30:09,294 INFO L226 Difference]: Without dead ends: 2362 [2025-03-08 06:30:09,294 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-08 06:30:09,294 INFO L435 NwaCegarLoop]: 1142 mSDtfsCounter, 5973 mSDsluCounter, 4580 mSDsCounter, 0 mSdLazyCounter, 4538 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5973 SdHoareTripleChecker+Valid, 5722 SdHoareTripleChecker+Invalid, 4545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:09,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5973 Valid, 5722 Invalid, 4545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4538 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:30:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-03-08 06:30:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1543. [2025-03-08 06:30:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4134742404227212) internal successors, (2140), 1542 states have internal predecessors, (2140), 0 states have call successors, (0), 0 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-08 06:30:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2140 transitions. [2025-03-08 06:30:09,306 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2140 transitions. Word has length 113 [2025-03-08 06:30:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:09,306 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2140 transitions. [2025-03-08 06:30:09,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2140 transitions. [2025-03-08 06:30:09,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:09,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:09,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:09,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:30:09,307 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1984311644, now seen corresponding path program 1 times [2025-03-08 06:30:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:09,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058445748] [2025-03-08 06:30:09,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:09,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:09,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:09,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:09,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:09,526 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-08 06:30:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:09,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058445748] [2025-03-08 06:30:09,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058445748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:09,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:09,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915140091] [2025-03-08 06:30:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:09,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:09,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:09,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:09,528 INFO L87 Difference]: Start difference. First operand 1543 states and 2140 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:10,817 INFO L93 Difference]: Finished difference Result 2502 states and 3474 transitions. [2025-03-08 06:30:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:10,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:10,820 INFO L225 Difference]: With dead ends: 2502 [2025-03-08 06:30:10,820 INFO L226 Difference]: Without dead ends: 2314 [2025-03-08 06:30:10,820 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-08 06:30:10,821 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 6320 mSDsluCounter, 3887 mSDsCounter, 0 mSdLazyCounter, 3935 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6320 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 3942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:10,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6320 Valid, 4835 Invalid, 3942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3935 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-03-08 06:30:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1543. [2025-03-08 06:30:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1514 states have (on average 1.4121532364597094) internal successors, (2138), 1542 states have internal predecessors, (2138), 0 states have call successors, (0), 0 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-08 06:30:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2138 transitions. [2025-03-08 06:30:10,833 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2138 transitions. Word has length 113 [2025-03-08 06:30:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:10,833 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2138 transitions. [2025-03-08 06:30:10,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2138 transitions. [2025-03-08 06:30:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:10,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:10,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:10,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:30:10,834 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:10,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash -141448387, now seen corresponding path program 1 times [2025-03-08 06:30:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:10,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845412082] [2025-03-08 06:30:10,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:10,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:10,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:10,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:10,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:11,140 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-08 06:30:11,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845412082] [2025-03-08 06:30:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845412082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:30:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132976198] [2025-03-08 06:30:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:11,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:30:11,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:11,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:30:11,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:30:11,141 INFO L87 Difference]: Start difference. First operand 1543 states and 2138 transitions. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:12,867 INFO L93 Difference]: Finished difference Result 3132 states and 4413 transitions. [2025-03-08 06:30:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:30:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:12,869 INFO L225 Difference]: With dead ends: 3132 [2025-03-08 06:30:12,869 INFO L226 Difference]: Without dead ends: 2922 [2025-03-08 06:30:12,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:30:12,870 INFO L435 NwaCegarLoop]: 1129 mSDtfsCounter, 10981 mSDsluCounter, 3992 mSDsCounter, 0 mSdLazyCounter, 4154 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10981 SdHoareTripleChecker+Valid, 5121 SdHoareTripleChecker+Invalid, 4462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 4154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:12,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10981 Valid, 5121 Invalid, 4462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 4154 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:30:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-03-08 06:30:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1551. [2025-03-08 06:30:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1522 states have (on average 1.4099868593955323) internal successors, (2146), 1550 states have internal predecessors, (2146), 0 states have call successors, (0), 0 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-08 06:30:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2146 transitions. [2025-03-08 06:30:12,882 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2146 transitions. Word has length 113 [2025-03-08 06:30:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:12,882 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2146 transitions. [2025-03-08 06:30:12,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:12,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2146 transitions. [2025-03-08 06:30:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:12,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:12,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:12,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:30:12,884 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:12,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 84972810, now seen corresponding path program 1 times [2025-03-08 06:30:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:12,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39193470] [2025-03-08 06:30:12,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:12,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:12,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:12,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:12,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:13,109 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-08 06:30:13,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:13,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39193470] [2025-03-08 06:30:13,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39193470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:13,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:13,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123849533] [2025-03-08 06:30:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:13,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:13,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:13,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:13,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:13,111 INFO L87 Difference]: Start difference. First operand 1551 states and 2146 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:14,405 INFO L93 Difference]: Finished difference Result 2506 states and 3474 transitions. [2025-03-08 06:30:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:14,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:14,408 INFO L225 Difference]: With dead ends: 2506 [2025-03-08 06:30:14,408 INFO L226 Difference]: Without dead ends: 2322 [2025-03-08 06:30:14,408 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-08 06:30:14,409 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 6316 mSDsluCounter, 3887 mSDsCounter, 0 mSdLazyCounter, 3931 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6316 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 3938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:14,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6316 Valid, 4835 Invalid, 3938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3931 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2025-03-08 06:30:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 1551. [2025-03-08 06:30:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1522 states have (on average 1.4086727989487517) internal successors, (2144), 1550 states have internal predecessors, (2144), 0 states have call successors, (0), 0 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-08 06:30:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2144 transitions. [2025-03-08 06:30:14,423 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2144 transitions. Word has length 113 [2025-03-08 06:30:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:14,423 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2144 transitions. [2025-03-08 06:30:14,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2144 transitions. [2025-03-08 06:30:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:14,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:14,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:14,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 06:30:14,425 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:14,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:14,425 INFO L85 PathProgramCache]: Analyzing trace with hash 118987148, now seen corresponding path program 1 times [2025-03-08 06:30:14,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:14,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500905551] [2025-03-08 06:30:14,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:14,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:14,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:14,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:14,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:14,615 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-08 06:30:14,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500905551] [2025-03-08 06:30:14,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500905551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:14,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120139678] [2025-03-08 06:30:14,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:14,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:14,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:14,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:14,616 INFO L87 Difference]: Start difference. First operand 1551 states and 2144 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)