./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-16 19:36:38,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:36:38,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:36:38,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:36:38,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:36:38,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:36:38,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:36:38,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:36:38,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:36:38,885 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:36:38,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:36:38,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:36:38,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:36:38,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:36:38,886 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:36:38,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:36:38,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:36:38,888 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:38,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:36:38,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:36:38,888 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-16 19:36:39,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:36:39,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:36:39,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:36:39,120 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:36:39,120 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:36:39,121 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-16 19:36:40,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da1c26c2/6fc58068443a4158bcb19cccae9bc730/FLAG6f5b82f59 [2025-03-16 19:36:40,708 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:36:40,710 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-16 19:36:40,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da1c26c2/6fc58068443a4158bcb19cccae9bc730/FLAG6f5b82f59 [2025-03-16 19:36:40,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da1c26c2/6fc58068443a4158bcb19cccae9bc730 [2025-03-16 19:36:40,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:36:40,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:36:40,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:40,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:36:40,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:36:40,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:40" (1/1) ... [2025-03-16 19:36:40,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a37141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:40, skipping insertion in model container [2025-03-16 19:36:40,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:40" (1/1) ... [2025-03-16 19:36:40,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:36:41,278 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-16 19:36:41,296 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-16 19:36:41,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[23299,23312] [2025-03-16 19:36:41,305 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-16 19:36:41,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[25792,25805] [2025-03-16 19:36:41,313 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-16 19:36:41,317 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-16 19:36:41,325 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-16 19:36:41,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[31201,31214] [2025-03-16 19:36:41,331 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-16 19:36:41,339 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-16 19:36:41,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-16 19:36:41,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-16 19:36:41,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-16 19:36:41,363 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-16 19:36:41,372 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-16 19:36:41,386 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-16 19:36:41,389 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-16 19:36:41,392 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-16 19:36:41,398 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-16 19:36:41,407 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-16 19:36:41,425 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-16 19:36:41,453 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-16 19:36:41,456 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-16 19:36:41,459 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-16 19:36:41,466 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-16 19:36:41,475 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-16 19:36:41,490 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-16 19:36:41,510 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-16 19:36:41,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:41,878 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:36:41,924 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-16 19:36:41,934 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-16 19:36:41,938 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-16 19:36:41,940 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-16 19:36:41,944 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-16 19:36:41,946 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-16 19:36:41,948 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-16 19:36:41,954 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-16 19:36:41,957 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-16 19:36:41,959 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-16 19:36:41,963 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-16 19:36:41,971 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-16 19:36:41,973 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-16 19:36:41,976 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-16 19:36:41,982 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-16 19:36:41,989 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-16 19:36:42,000 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-16 19:36:42,002 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-16 19:36:42,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[54527,54540] [2025-03-16 19:36:42,010 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-16 19:36:42,017 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-16 19:36:42,031 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-16 19:36:42,054 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-16 19:36:42,057 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-16 19:36:42,060 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-16 19:36:42,064 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-16 19:36:42,071 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-16 19:36:42,081 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-16 19:36:42,099 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-16 19:36:42,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:42,391 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:36:42,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42 WrapperNode [2025-03-16 19:36:42,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:42,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:42,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:36:42,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:36:42,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,618 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 12868 [2025-03-16 19:36:42,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:42,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:36:42,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:36:42,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:36:42,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,717 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-16 19:36:42,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:36:42,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:36:42,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:36:42,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:36:42,890 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (1/1) ... [2025-03-16 19:36:42,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:42,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:36:42,915 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-16 19:36:42,921 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-16 19:36:42,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:36:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:36:42,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:36:42,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:36:43,227 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:36:43,228 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:36:47,592 INFO L1322 $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-16 19:36:47,593 INFO L1322 $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-16 19:36:47,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2614: havoc main_~node7__m7~11#1; [2025-03-16 19:36:47,593 INFO L1322 $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-16 19:36:47,593 INFO L1322 $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-16 19:36:47,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4994: havoc main_~node5__m5~9#1; [2025-03-16 19:36:47,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12393: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-16 19:36:47,593 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7108: havoc main_~node7__m7~49#1; [2025-03-16 19:36:47,593 INFO L1322 $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-16 19:36:47,593 INFO L1322 $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-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19793: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8168: havoc main_~check__tmp~65#1;havoc main_~node7__m7~58#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16096: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14247: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~94#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11869: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~81#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19269: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~121#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15569: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~101#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10550: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~38#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3946: havoc main_~check__tmp~34#1;havoc main_~node7__m7~21#1; [2025-03-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L775: havoc main_~node2__m2~2#1; [2025-03-16 19:36:47,594 INFO L1322 $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-16 19:36:47,594 INFO L1322 $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-16 19:36:47,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-16 19:36:47,595 INFO L1322 $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-16 19:36:47,595 INFO L1322 $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-16 19:36:47,595 INFO L1322 $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-16 19:36:47,595 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5273: havoc main_~node7__m7~33#1; [2025-03-16 19:36:47,595 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5009: havoc main_~node6__m6~16#1; [2025-03-16 19:36:47,595 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7916: havoc main_~node6__m6~29#1; [2025-03-16 19:36:47,595 INFO L1322 $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-16 19:36:47,595 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12410: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~43#1; [2025-03-16 19:36:47,595 INFO L1322 $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-16 19:36:47,595 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19810: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~63#1; [2025-03-16 19:36:47,595 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4219: havoc main_~check__tmp~37#1;havoc main_~node7__m7~23#1; [2025-03-16 19:36:47,595 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2105: havoc main_~check__tmp~13#1; [2025-03-16 19:36:47,595 INFO L1322 $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-16 19:36:47,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16113: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-16 19:36:47,596 INFO L1322 $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-16 19:36:47,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12945: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~87#1; [2025-03-16 19:36:47,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10567: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~74#1; [2025-03-16 19:36:47,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20345: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~127#1; [2025-03-16 19:36:47,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L790: havoc main_~node3__m3~2#1; [2025-03-16 19:36:47,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6340: havoc main_~node7__m7~41#1; [2025-03-16 19:36:47,596 INFO L1322 $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-16 19:36:47,596 INFO L1322 $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-16 19:36:47,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: havoc main_~check__tmp~26#1;havoc main_~node7__m7~15#1; [2025-03-16 19:36:47,596 INFO L1322 $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-16 19:36:47,596 INFO L1322 $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-16 19:36:47,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17970: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~58#1; [2025-03-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1058: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1852: havoc main_~node5__m5~3#1; [2025-03-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6873: havoc main_~node5__m5~13#1; [2025-03-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-16 19:36:47,597 INFO L1322 $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-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2910: havoc main_~check__tmp~23#1;havoc main_~node7__m7~13#1; [2025-03-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7931: havoc main_~node7__m7~56#1; [2025-03-16 19:36:47,597 INFO L1322 $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-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11105: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~77#1; [2025-03-16 19:36:47,597 INFO L1322 $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-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12427: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~84#1; [2025-03-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19827: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~124#1; [2025-03-16 19:36:47,597 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11635: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-16 19:36:47,597 INFO L1322 $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-16 19:36:47,598 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3445: havoc main_~node3__m3~3#1; [2025-03-16 19:36:47,598 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16130: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~53#1; [2025-03-16 19:36:47,598 INFO L1322 $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-16 19:36:47,598 INFO L1322 $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-16 19:36:47,598 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L805: havoc main_~node4__m4~2#1; [2025-03-16 19:36:47,598 INFO L1322 $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-16 19:36:47,598 INFO L1322 $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-16 19:36:47,598 INFO L1322 $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-16 19:36:47,598 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8470: havoc main_~node5__m5~17#1; [2025-03-16 19:36:47,598 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9265: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~67#1; [2025-03-16 19:36:47,598 INFO L1322 $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-16 19:36:47,598 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16665: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~107#1; [2025-03-16 19:36:47,598 INFO L1322 $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-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1867: havoc main_~node6__m6~4#1; [2025-03-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17987: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~114#1; [2025-03-16 19:36:47,599 INFO L1322 $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-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6888: havoc main_~node6__m6~24#1; [2025-03-16 19:36:47,599 INFO L1322 $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-16 19:36:47,599 INFO L1322 $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-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-16 19:36:47,599 INFO L1322 $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-16 19:36:47,599 INFO L1322 $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-16 19:36:47,599 INFO L1322 $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-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11652: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3460: havoc main_~node4__m4~4#1; [2025-03-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19052: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6633: havoc main_~check__tmp~57#1;havoc main_~node7__m7~43#1; [2025-03-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16147: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~104#1; [2025-03-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18525: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~117#1; [2025-03-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc main_~node5__m5~2#1; [2025-03-16 19:36:47,599 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4520: havoc main_~node4__m4~5#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728: havoc main_~check__tmp~31#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9806: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~36#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8485: havoc main_~node6__m6~32#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13506: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~46#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17206: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~56#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5053: havoc main_~check__tmp~43#1;havoc main_~node7__m7~30#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1882: havoc main_~node7__m7~6#1; [2025-03-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7432: havoc main_~check__tmp~62#1;havoc main_~node7__m7~51#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4790: havoc main_~node6__m6~15#1; [2025-03-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8229: havoc main_~node7__m7~59#1; [2025-03-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6116: havoc main_~check__tmp~52#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3475: havoc main_~node5__m5~6#1; [2025-03-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11669: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L835: havoc main_~node6__m6~2#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15369: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-16 19:36:47,600 INFO L1322 $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-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4535: havoc main_~node5__m5~8#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19069: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5857: havoc main_~check__tmp~49#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8500: havoc main_~node7__m7~62#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9823: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~70#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2424: havoc main_~node4__m4~3#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13523: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~90#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1103: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:47,600 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17223: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~110#1; [2025-03-16 19:36:47,601 INFO L1322 $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-16 19:36:47,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14845: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~97#1; [2025-03-16 19:36:47,601 INFO L1322 $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-16 19:36:47,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162: havoc main_~node6__m6~5#1; [2025-03-16 19:36:47,601 INFO L1322 $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-16 19:36:47,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2692: havoc main_~check__tmp~20#1; [2025-03-16 19:36:47,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7715: havoc main_~node5__m5~15#1; [2025-03-16 19:36:47,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490: havoc main_~node6__m6~10#1; [2025-03-16 19:36:47,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1376: havoc main_~node7__m7~3#1; [2025-03-16 19:36:47,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14061: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~93#1; [2025-03-16 19:36:47,601 INFO L1322 $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-16 19:36:47,601 INFO L1322 $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-16 19:36:47,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4550: havoc main_~node6__m6~14#1; [2025-03-16 19:36:47,601 INFO L1322 $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-16 19:36:47,602 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L851: havoc main_~node7__m7~2#1; [2025-03-16 19:36:47,602 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11686: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~41#1; [2025-03-16 19:36:47,602 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15386: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~51#1; [2025-03-16 19:36:47,602 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14594: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-16 19:36:47,602 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19086: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~61#1; [2025-03-16 19:36:47,602 INFO L1322 $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-16 19:36:47,602 INFO L1322 $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-16 19:36:47,602 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2439: havoc main_~node5__m5~4#1; [2025-03-16 19:36:47,602 INFO L1322 $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-16 19:36:47,602 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6932: havoc main_~check__tmp~59#1;havoc main_~node7__m7~46#1; [2025-03-16 19:36:47,603 INFO L1322 $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-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3234: havoc main_~node6__m6~9#1; [2025-03-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2177: havoc main_~node7__m7~8#1; [2025-03-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12221: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~83#1; [2025-03-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19621: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~123#1; [2025-03-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15921: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~103#1; [2025-03-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7994: havoc main_~node7__m7~57#1; [2025-03-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7730: havoc main_~node6__m6~28#1; [2025-03-16 19:36:47,603 INFO L1322 $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-16 19:36:47,603 INFO L1322 $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-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc main_~node7__m7~18#1; [2025-03-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4298: havoc main_~node6__m6~13#1; [2025-03-16 19:36:47,603 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10905: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-16 19:36:47,604 INFO L1322 $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-16 19:36:47,604 INFO L1322 $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-16 19:36:47,604 INFO L1322 $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-16 19:36:47,604 INFO L1322 $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-16 19:36:47,604 INFO L1322 $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-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4565: havoc main_~node7__m7~26#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10381: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~73#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454: havoc main_~node6__m6~6#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11703: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~80#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15403: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~100#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14611: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19103: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~120#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4834: havoc main_~check__tmp~42#1;havoc main_~node7__m7~28#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12762: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~44#1; [2025-03-16 19:36:47,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20162: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~64#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4043: havoc main_~node5__m5~7#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5629: havoc main_~node7__m7~35#1; [2025-03-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3785: havoc main_~node6__m6~11#1; [2025-03-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: havoc main_~node5__m5~5#1; [2025-03-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10922: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~39#1; [2025-03-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469: havoc main_~node7__m7~10#1; [2025-03-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7226: havoc main_~node3__m3~5#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18325: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1148: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6698: havoc main_~node6__m6~23#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5114: havoc main_~node7__m7~31#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: havoc main_~node2__m2~1#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14628: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11457: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~79#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4058: havoc main_~node6__m6~12#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12779: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~86#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20179: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~126#1; [2025-03-16 19:36:47,605 INFO L1322 $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-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17801: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~113#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9082: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~34#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16482: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~54#1; [2025-03-16 19:36:47,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6442: havoc main_~node4__m4~7#1; [2025-03-16 19:36:47,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3800: havoc main_~node7__m7~20#1; [2025-03-16 19:36:47,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3008: havoc main_~node6__m6~8#1; [2025-03-16 19:36:47,606 INFO L1322 $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-16 19:36:47,606 INFO L1322 $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-16 19:36:47,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10939: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~76#1; [2025-03-16 19:36:47,606 INFO L1322 $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-16 19:36:47,606 INFO L1322 $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-16 19:36:47,606 INFO L1322 $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-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6184: havoc main_~check__tmp~53#1;havoc main_~node7__m7~39#1; [2025-03-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7241: havoc main_~node4__m4~8#1; [2025-03-16 19:36:47,607 INFO L1322 $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-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749: havoc main_~node6__m6~7#1; [2025-03-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8563: havoc main_~node7__m7~63#1; [2025-03-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3278: havoc main_~check__tmp~27#1;havoc main_~node7__m7~16#1; [2025-03-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18342: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~59#1; [2025-03-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6979: havoc main_~node7__m7~47#1; [2025-03-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: havoc main_~node3__m3~1#1; [2025-03-16 19:36:47,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4073: havoc main_~node7__m7~22#1; [2025-03-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7774: havoc main_~check__tmp~64#1;havoc main_~node7__m7~54#1; [2025-03-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14645: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5925: havoc main_~check__tmp~50#1;havoc main_~node7__m7~37#1; [2025-03-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7511: havoc main_~node6__m6~27#1; [2025-03-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1699: havoc main_~node7__m7~5#1; [2025-03-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4342: havoc main_~check__tmp~38#1;havoc main_~node7__m7~24#1; [2025-03-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9099: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~66#1; [2025-03-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16499: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~106#1; [2025-03-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6457: havoc main_~node5__m5~12#1; [2025-03-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18877: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~119#1; [2025-03-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3023: havoc main_~node7__m7~14#1; [2025-03-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8310: havoc main_~node6__m6~31#1; [2025-03-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13861: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $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-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7256: havoc main_~node5__m5~14#1; [2025-03-16 19:36:47,608 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2764: havoc main_~node7__m7~12#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10164: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L652: havoc main_~node4__m4~1#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9637: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~69#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409: havoc main_~node2__m2~3#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13337: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~89#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17037: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~109#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18359: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~116#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17567: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14662: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~49#1; [2025-03-16 19:36:47,609 INFO L1322 $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-16 19:36:47,609 INFO L1322 $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-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6472: havoc main_~node6__m6~22#1; [2025-03-16 19:36:47,609 INFO L1322 $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-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8325: havoc main_~node7__m7~60#1; [2025-03-16 19:36:47,609 INFO L1322 $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-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15197: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~99#1; [2025-03-16 19:36:47,609 INFO L1322 $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-16 19:36:47,609 INFO L1322 $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-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6742: havoc main_~check__tmp~58#1;havoc main_~node7__m7~44#1; [2025-03-16 19:36:47,609 INFO L1322 $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-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1193: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:47,609 INFO L1322 $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-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7271: havoc main_~node6__m6~26#1; [2025-03-16 19:36:47,609 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13878: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~47#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4895: havoc main_~node7__m7~29#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc main_~node5__m5~1#1; [2025-03-16 19:36:47,612 INFO L1322 $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-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5424: havoc main_~node3__m3~4#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10181: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-16 19:36:47,612 INFO L1322 $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-16 19:36:47,612 INFO L1322 $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-16 19:36:47,612 INFO L1322 $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-16 19:36:47,612 INFO L1322 $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-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: havoc main_~check__tmp~15#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14413: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~95#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17584: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-16 19:36:47,612 INFO L1322 $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-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6487: havoc main_~node7__m7~42#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14679: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~96#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12038: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~42#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15738: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~52#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19438: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~62#1; [2025-03-16 19:36:47,612 INFO L1322 $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-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4643: havoc main_~check__tmp~40#1; [2025-03-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7286: havoc main_~node7__m7~50#1; [2025-03-16 19:36:47,612 INFO L1322 $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-16 19:36:47,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L682: havoc main_~node6__m6~1#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13895: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~92#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5439: havoc main_~node4__m4~6#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3325: havoc main_~node7__m7~17#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7555: havoc main_~check__tmp~63#1;havoc main_~node7__m7~52#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10198: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~37#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5707: havoc main_~check__tmp~47#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17601: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10733: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~75#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12055: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~82#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15755: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~102#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19455: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~122#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8094: havoc main_~node4__m4~9#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L697: havoc main_~node7__m7~1#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5454: havoc main_~node5__m5~10#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6249: havoc main_~node6__m6~21#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7835: havoc main_~node7__m7~55#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13120: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-16 19:36:47,613 INFO L1322 $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-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12593: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~85#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10215: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~72#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19993: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~125#1; [2025-03-16 19:36:47,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5195: havoc main_~node6__m6~17#1; [2025-03-16 19:36:47,614 INFO L1322 $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-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7045: havoc main_~node6__m6~25#1; [2025-03-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4403: havoc main_~node7__m7~25#1; [2025-03-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11274: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L968: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17618: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~57#1; [2025-03-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2027: havoc main_~node7__m7~7#1; [2025-03-16 19:36:47,614 INFO L1322 $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-16 19:36:47,614 INFO L1322 $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-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3878: havoc main_~check__tmp~33#1; [2025-03-16 19:36:47,614 INFO L1322 $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-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8109: havoc main_~node5__m5~16#1; [2025-03-16 19:36:47,614 INFO L1322 $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-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6789: havoc main_~node7__m7~45#1; [2025-03-16 19:36:47,614 INFO L1322 $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-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18153: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~115#1; [2025-03-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5469: havoc main_~node6__m6~18#1; [2025-03-16 19:36:47,614 INFO L1322 $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-16 19:36:47,614 INFO L1322 $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-16 19:36:47,614 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8642: havoc main_~node7__m7~64#1;havoc main_~node6__m6~33#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1244: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4151: havoc main_~check__tmp~36#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9437: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13137: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16837: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5210: havoc main_~node7__m7~32#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7060: havoc main_~node7__m7~48#1; [2025-03-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1777: havoc main_~check__tmp~9#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11291: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~78#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8913: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~65#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16313: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~105#1; [2025-03-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17635: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~112#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: havoc main_~check__tmp~25#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6008: havoc main_~node5__m5~11#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18694: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~60#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8388: havoc main_~node7__m7~61#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8124: havoc main_~node6__m6~30#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5484: havoc main_~node7__m7~34#1; [2025-03-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2842: havoc main_~check__tmp~22#1; [2025-03-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $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-16 19:36:47,615 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9454: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~35#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13154: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~45#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16854: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~55#1; [2025-03-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2323: havoc main_~check__tmp~16#1;havoc main_~node7__m7~9#1; [2025-03-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6023: havoc main_~node6__m6~20#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9989: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~71#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13689: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~91#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17389: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~111#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18711: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~118#1; [2025-03-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3650: havoc main_~node7__m7~19#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5764: havoc main_~node6__m6~19#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6293: havoc main_~check__tmp~54#1;havoc main_~node7__m7~40#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15014: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~50#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7616: havoc main_~node7__m7~53#1; [2025-03-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $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-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1539: havoc main_~node6__m6~3#1; [2025-03-16 19:36:47,618 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4711: havoc main_~check__tmp~41#1;havoc main_~node7__m7~27#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1013: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9471: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~68#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13171: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~88#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16871: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~108#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6565: havoc main_~check__tmp~56#1; [2025-03-16 19:36:47,619 INFO L1322 $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-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6038: havoc main_~node7__m7~38#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14230: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-16 19:36:47,619 INFO L1322 $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-16 19:36:47,619 INFO L1322 $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-16 19:36:47,619 INFO L1322 $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-16 19:36:47,619 INFO L1322 $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-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7364: havoc main_~check__tmp~61#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5779: havoc main_~node7__m7~36#1; [2025-03-16 19:36:47,619 INFO L1322 $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-16 19:36:47,619 INFO L1322 $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-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15031: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~98#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1554: havoc main_~node7__m7~4#1; [2025-03-16 19:36:47,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-16 19:36:48,039 INFO L? ?]: Removed 1884 outVars from TransFormulas that were not future-live. [2025-03-16 19:36:48,040 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:36:48,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:36:48,091 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:36:48,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:36:48 BoogieIcfgContainer [2025-03-16 19:36:48,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:36:48,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:36:48,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:36:48,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:36:48,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:36:40" (1/3) ... [2025-03-16 19:36:48,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577e22a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:36:48, skipping insertion in model container [2025-03-16 19:36:48,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:42" (2/3) ... [2025-03-16 19:36:48,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577e22a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:36:48, skipping insertion in model container [2025-03-16 19:36:48,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:36:48" (3/3) ... [2025-03-16 19:36:48,099 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:36:48,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:36:48,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 2063 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-16 19:36:48,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:36:48,205 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;@25919d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:36:48,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-16 19:36:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 2063 states, 2033 states have (on average 1.8681751106738809) internal successors, (3798), 2062 states have internal predecessors, (3798), 0 states have call successors, (0), 0 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-16 19:36:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 19:36:48,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:48,234 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] [2025-03-16 19:36:48,234 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-16 19:36:48,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash -319454365, now seen corresponding path program 1 times [2025-03-16 19:36:48,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722814997] [2025-03-16 19:36:48,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:48,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:48,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 19:36:48,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 19:36:48,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:48,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:48,868 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-16 19:36:48,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:48,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722814997] [2025-03-16 19:36:48,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722814997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:48,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:48,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:48,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981246752] [2025-03-16 19:36:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:48,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:48,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:48,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:48,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:48,898 INFO L87 Difference]: Start difference. First operand has 2063 states, 2033 states have (on average 1.8681751106738809) internal successors, (3798), 2062 states have internal predecessors, (3798), 0 states have call successors, (0), 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 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:36:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:49,925 INFO L93 Difference]: Finished difference Result 3059 states and 5455 transitions. [2025-03-16 19:36:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:49,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-16 19:36:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:49,947 INFO L225 Difference]: With dead ends: 3059 [2025-03-16 19:36:49,947 INFO L226 Difference]: Without dead ends: 1572 [2025-03-16 19:36:49,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:49,958 INFO L435 NwaCegarLoop]: 1835 mSDtfsCounter, 8224 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8224 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:49,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8224 Valid, 1897 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:36:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-16 19:36:50,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-16 19:36:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.3266364225534673) internal successors, (2047), 1571 states have internal predecessors, (2047), 0 states have call successors, (0), 0 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-16 19:36:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2047 transitions. [2025-03-16 19:36:50,038 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2047 transitions. Word has length 99 [2025-03-16 19:36:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:50,039 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2047 transitions. [2025-03-16 19:36:50,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 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-16 19:36:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2047 transitions. [2025-03-16 19:36:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:36:50,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:50,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:50,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:36:50,044 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-16 19:36:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2123247062, now seen corresponding path program 1 times [2025-03-16 19:36:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542332867] [2025-03-16 19:36:50,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:50,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:36:50,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:36:50,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:50,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:50,277 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-16 19:36:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542332867] [2025-03-16 19:36:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542332867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:50,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11572867] [2025-03-16 19:36:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:50,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:50,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:50,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:50,279 INFO L87 Difference]: Start difference. First operand 1572 states and 2047 transitions. 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-16 19:36:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:51,233 INFO L93 Difference]: Finished difference Result 3138 states and 4250 transitions. [2025-03-16 19:36:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:51,234 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-16 19:36:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:51,240 INFO L225 Difference]: With dead ends: 3138 [2025-03-16 19:36:51,240 INFO L226 Difference]: Without dead ends: 1886 [2025-03-16 19:36:51,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:51,242 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 6792 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6792 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:51,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6792 Valid, 1446 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:36:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2025-03-16 19:36:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1784. [2025-03-16 19:36:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1755 states have (on average 1.4074074074074074) internal successors, (2470), 1783 states have internal predecessors, (2470), 0 states have call successors, (0), 0 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-16 19:36:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2470 transitions. [2025-03-16 19:36:51,273 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2470 transitions. Word has length 100 [2025-03-16 19:36:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:51,274 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2470 transitions. [2025-03-16 19:36:51,274 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-16 19:36:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2470 transitions. [2025-03-16 19:36:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:36:51,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:51,277 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-16 19:36:51,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:36:51,278 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-16 19:36:51,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:51,278 INFO L85 PathProgramCache]: Analyzing trace with hash -873462325, now seen corresponding path program 1 times [2025-03-16 19:36:51,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:51,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184761029] [2025-03-16 19:36:51,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:51,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:51,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:36:51,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:36:51,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:51,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:51,420 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-16 19:36:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184761029] [2025-03-16 19:36:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184761029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:51,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579997309] [2025-03-16 19:36:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:51,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:51,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:51,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:51,422 INFO L87 Difference]: Start difference. First operand 1784 states and 2470 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-16 19:36:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:52,015 INFO L93 Difference]: Finished difference Result 3248 states and 4589 transitions. [2025-03-16 19:36:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:52,016 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-16 19:36:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:52,021 INFO L225 Difference]: With dead ends: 3248 [2025-03-16 19:36:52,021 INFO L226 Difference]: Without dead ends: 1653 [2025-03-16 19:36:52,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:52,026 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 4733 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4733 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:52,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4733 Valid, 910 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:36:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2025-03-16 19:36:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1653. [2025-03-16 19:36:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1624 states have (on average 1.4291871921182266) internal successors, (2321), 1652 states have internal predecessors, (2321), 0 states have call successors, (0), 0 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-16 19:36:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2321 transitions. [2025-03-16 19:36:52,054 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2321 transitions. Word has length 101 [2025-03-16 19:36:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:52,054 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2321 transitions. [2025-03-16 19:36:52,054 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-16 19:36:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2321 transitions. [2025-03-16 19:36:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:36:52,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:52,058 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-16 19:36:52,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:36:52,059 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-16 19:36:52,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:52,060 INFO L85 PathProgramCache]: Analyzing trace with hash 142326674, now seen corresponding path program 1 times [2025-03-16 19:36:52,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:52,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861703329] [2025-03-16 19:36:52,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:52,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:36:52,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:36:52,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:52,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:52,201 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-16 19:36:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861703329] [2025-03-16 19:36:52,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861703329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:52,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:52,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047301750] [2025-03-16 19:36:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:52,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:52,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:52,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:52,202 INFO L87 Difference]: Start difference. First operand 1653 states and 2321 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-16 19:36:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:52,821 INFO L93 Difference]: Finished difference Result 3117 states and 4438 transitions. [2025-03-16 19:36:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:52,821 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-16 19:36:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:52,825 INFO L225 Difference]: With dead ends: 3117 [2025-03-16 19:36:52,825 INFO L226 Difference]: Without dead ends: 1613 [2025-03-16 19:36:52,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:52,827 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 4473 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4473 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:52,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4473 Valid, 696 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:36:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2025-03-16 19:36:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2025-03-16 19:36:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1584 states have (on average 1.433712121212121) internal successors, (2271), 1612 states have internal predecessors, (2271), 0 states have call successors, (0), 0 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-16 19:36:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2271 transitions. [2025-03-16 19:36:52,848 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2271 transitions. Word has length 102 [2025-03-16 19:36:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:52,848 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2271 transitions. [2025-03-16 19:36:52,848 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-16 19:36:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2271 transitions. [2025-03-16 19:36:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:36:52,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:52,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:36:52,850 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-16 19:36:52,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1916538493, now seen corresponding path program 1 times [2025-03-16 19:36:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411658802] [2025-03-16 19:36:52,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:52,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:36:52,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:36:52,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:52,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:52,987 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-16 19:36:52,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:52,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411658802] [2025-03-16 19:36:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411658802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:52,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047053654] [2025-03-16 19:36:52,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:52,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:52,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:52,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:52,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:52,988 INFO L87 Difference]: Start difference. First operand 1613 states and 2271 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-16 19:36:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:53,475 INFO L93 Difference]: Finished difference Result 3077 states and 4386 transitions. [2025-03-16 19:36:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:53,475 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-16 19:36:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:53,479 INFO L225 Difference]: With dead ends: 3077 [2025-03-16 19:36:53,479 INFO L226 Difference]: Without dead ends: 1581 [2025-03-16 19:36:53,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:53,481 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 4403 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4403 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:53,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4403 Valid, 787 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:36:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2025-03-16 19:36:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1581. [2025-03-16 19:36:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1552 states have (on average 1.4387886597938144) internal successors, (2233), 1580 states have internal predecessors, (2233), 0 states have call successors, (0), 0 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-16 19:36:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2233 transitions. [2025-03-16 19:36:53,500 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2233 transitions. Word has length 103 [2025-03-16 19:36:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:53,500 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2233 transitions. [2025-03-16 19:36:53,500 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-16 19:36:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2233 transitions. [2025-03-16 19:36:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:36:53,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:53,502 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-16 19:36:53,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:36:53,502 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-16 19:36:53,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1000903998, now seen corresponding path program 1 times [2025-03-16 19:36:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:53,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018220640] [2025-03-16 19:36:53,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:53,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:36:53,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:36:53,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:53,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:53,647 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-16 19:36:53,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:53,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018220640] [2025-03-16 19:36:53,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018220640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:53,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:53,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50932724] [2025-03-16 19:36:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:53,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:53,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:53,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:53,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:53,648 INFO L87 Difference]: Start difference. First operand 1581 states and 2233 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-16 19:36:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:54,137 INFO L93 Difference]: Finished difference Result 3045 states and 4346 transitions. [2025-03-16 19:36:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:54,137 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-16 19:36:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:54,140 INFO L225 Difference]: With dead ends: 3045 [2025-03-16 19:36:54,141 INFO L226 Difference]: Without dead ends: 1553 [2025-03-16 19:36:54,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:54,142 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 4369 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:54,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 832 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:36:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-03-16 19:36:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1553. [2025-03-16 19:36:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1524 states have (on average 1.444225721784777) internal successors, (2201), 1552 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2201 transitions. [2025-03-16 19:36:54,158 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2201 transitions. Word has length 104 [2025-03-16 19:36:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:54,158 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 2201 transitions. [2025-03-16 19:36:54,159 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-16 19:36:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2201 transitions. [2025-03-16 19:36:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:36:54,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:54,161 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-16 19:36:54,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:36:54,161 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-16 19:36:54,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash -736654273, now seen corresponding path program 1 times [2025-03-16 19:36:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:54,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307781014] [2025-03-16 19:36:54,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:54,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:54,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:36:54,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:36:54,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:54,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:54,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307781014] [2025-03-16 19:36:54,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307781014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:54,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:54,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:54,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694020977] [2025-03-16 19:36:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:54,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:54,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:54,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:54,280 INFO L87 Difference]: Start difference. First operand 1553 states and 2201 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-16 19:36:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:54,797 INFO L93 Difference]: Finished difference Result 3017 states and 4312 transitions. [2025-03-16 19:36:54,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:54,798 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-16 19:36:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:54,801 INFO L225 Difference]: With dead ends: 3017 [2025-03-16 19:36:54,801 INFO L226 Difference]: Without dead ends: 1542 [2025-03-16 19:36:54,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:54,803 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 4296 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4296 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:54,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4296 Valid, 805 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:36:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2025-03-16 19:36:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2025-03-16 19:36:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4454725710508922) internal successors, (2187), 1541 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-16 19:36:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2187 transitions. [2025-03-16 19:36:54,818 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2187 transitions. Word has length 105 [2025-03-16 19:36:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:54,818 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2187 transitions. [2025-03-16 19:36:54,818 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-16 19:36:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2187 transitions. [2025-03-16 19:36:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:36:54,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:54,820 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-16 19:36:54,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:36:54,820 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-16 19:36:54,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1108998667, now seen corresponding path program 1 times [2025-03-16 19:36:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:54,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106040753] [2025-03-16 19:36:54,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:54,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:36:54,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:36:54,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:54,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106040753] [2025-03-16 19:36:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106040753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:36:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138373758] [2025-03-16 19:36:55,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:55,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:36:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:55,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:36:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:36:55,314 INFO L87 Difference]: Start difference. First operand 1542 states and 2187 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 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-16 19:36:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:56,878 INFO L93 Difference]: Finished difference Result 2770 states and 3909 transitions. [2025-03-16 19:36:56,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:36:56,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 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-16 19:36:56,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:56,883 INFO L225 Difference]: With dead ends: 2770 [2025-03-16 19:36:56,883 INFO L226 Difference]: Without dead ends: 2120 [2025-03-16 19:36:56,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:36:56,884 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 6055 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 4254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6055 SdHoareTripleChecker+Valid, 5102 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:56,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6055 Valid, 5102 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4254 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:36:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2025-03-16 19:36:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1542. [2025-03-16 19:36:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4441506939854594) internal successors, (2185), 1541 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-16 19:36:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2185 transitions. [2025-03-16 19:36:56,904 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2185 transitions. Word has length 106 [2025-03-16 19:36:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:56,904 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2185 transitions. [2025-03-16 19:36:56,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 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-16 19:36:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2185 transitions. [2025-03-16 19:36:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:36:56,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:56,906 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-16 19:36:56,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:36:56,906 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:56,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash 771837058, now seen corresponding path program 1 times [2025-03-16 19:36:56,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:56,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792674219] [2025-03-16 19:36:56,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:56,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:56,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:36:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:36:56,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:56,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:57,289 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-16 19:36:57,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:57,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792674219] [2025-03-16 19:36:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792674219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:57,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:57,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:36:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350008435] [2025-03-16 19:36:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:57,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:36:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:57,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:36:57,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:57,290 INFO L87 Difference]: Start difference. First operand 1542 states and 2185 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 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-16 19:36:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:58,513 INFO L93 Difference]: Finished difference Result 2661 states and 3644 transitions. [2025-03-16 19:36:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:36:58,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 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-16 19:36:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:58,518 INFO L225 Difference]: With dead ends: 2661 [2025-03-16 19:36:58,518 INFO L226 Difference]: Without dead ends: 2001 [2025-03-16 19:36:58,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:36:58,519 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 4144 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 3100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:58,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 2686 Invalid, 3100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:36:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2025-03-16 19:36:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1542. [2025-03-16 19:36:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4434897554527428) internal successors, (2184), 1541 states have internal predecessors, (2184), 0 states have call successors, (0), 0 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-16 19:36:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2184 transitions. [2025-03-16 19:36:58,539 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2184 transitions. Word has length 106 [2025-03-16 19:36:58,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:58,539 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2184 transitions. [2025-03-16 19:36:58,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 6 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-16 19:36:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2184 transitions. [2025-03-16 19:36:58,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:36:58,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:58,542 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-16 19:36:58,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:36:58,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:58,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash -899835675, now seen corresponding path program 1 times [2025-03-16 19:36:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:58,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975489996] [2025-03-16 19:36:58,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:58,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:58,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:36:58,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:36:58,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:58,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:58,921 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-16 19:36:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975489996] [2025-03-16 19:36:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975489996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:58,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:58,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:36:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926206821] [2025-03-16 19:36:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:36:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:58,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:36:58,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:36:58,922 INFO L87 Difference]: Start difference. First operand 1542 states and 2184 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 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-16 19:37:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:00,413 INFO L93 Difference]: Finished difference Result 2635 states and 3732 transitions. [2025-03-16 19:37:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:37:00,413 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 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-16 19:37:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:00,418 INFO L225 Difference]: With dead ends: 2635 [2025-03-16 19:37:00,418 INFO L226 Difference]: Without dead ends: 2405 [2025-03-16 19:37:00,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:37:00,420 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 6156 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 4038 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6156 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 4048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:00,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6156 Valid, 4753 Invalid, 4048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4038 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2025-03-16 19:37:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1551. [2025-03-16 19:37:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1522 states have (on average 1.442838370565046) internal successors, (2196), 1550 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2196 transitions. [2025-03-16 19:37:00,438 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2196 transitions. Word has length 106 [2025-03-16 19:37:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:00,438 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2196 transitions. [2025-03-16 19:37:00,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 10 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-16 19:37:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2196 transitions. [2025-03-16 19:37:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:37:00,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:00,440 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-16 19:37:00,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:37:00,441 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:00,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1468759180, now seen corresponding path program 1 times [2025-03-16 19:37:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460475397] [2025-03-16 19:37:00,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:00,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:37:00,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:37:00,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:00,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:00,718 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-16 19:37:00,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:00,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460475397] [2025-03-16 19:37:00,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460475397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:00,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:00,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:00,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127193335] [2025-03-16 19:37:00,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:00,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:00,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:00,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:00,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:00,719 INFO L87 Difference]: Start difference. First operand 1551 states and 2196 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 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-16 19:37:01,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:01,957 INFO L93 Difference]: Finished difference Result 2014 states and 2872 transitions. [2025-03-16 19:37:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:01,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 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-16 19:37:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:01,961 INFO L225 Difference]: With dead ends: 2014 [2025-03-16 19:37:01,961 INFO L226 Difference]: Without dead ends: 1630 [2025-03-16 19:37:01,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:01,962 INFO L435 NwaCegarLoop]: 1108 mSDtfsCounter, 2424 mSDsluCounter, 3665 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 4773 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:01,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2424 Valid, 4773 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2025-03-16 19:37:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1542. [2025-03-16 19:37:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4428288169200265) internal successors, (2183), 1541 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-16 19:37:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2183 transitions. [2025-03-16 19:37:01,976 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2183 transitions. Word has length 106 [2025-03-16 19:37:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:01,976 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2183 transitions. [2025-03-16 19:37:01,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 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-16 19:37:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2183 transitions. [2025-03-16 19:37:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:37:01,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:01,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:01,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:37:01,977 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:01,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash -842204765, now seen corresponding path program 1 times [2025-03-16 19:37:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:01,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987495183] [2025-03-16 19:37:01,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:01,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:37:02,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:37:02,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:02,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:02,254 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-16 19:37:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:02,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987495183] [2025-03-16 19:37:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987495183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:02,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:02,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:02,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296297570] [2025-03-16 19:37:02,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:02,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:02,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:02,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:02,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:02,255 INFO L87 Difference]: Start difference. First operand 1542 states and 2183 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 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-16 19:37:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:03,998 INFO L93 Difference]: Finished difference Result 2678 states and 3814 transitions. [2025-03-16 19:37:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:03,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 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-16 19:37:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:04,003 INFO L225 Difference]: With dead ends: 2678 [2025-03-16 19:37:04,003 INFO L226 Difference]: Without dead ends: 2417 [2025-03-16 19:37:04,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:04,004 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 4443 mSDsluCounter, 4977 mSDsCounter, 0 mSdLazyCounter, 4655 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4443 SdHoareTripleChecker+Valid, 6546 SdHoareTripleChecker+Invalid, 4658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:04,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4443 Valid, 6546 Invalid, 4658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4655 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:37:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2025-03-16 19:37:04,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1542. [2025-03-16 19:37:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.44216787838731) internal successors, (2182), 1541 states have internal predecessors, (2182), 0 states have call successors, (0), 0 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-16 19:37:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2182 transitions. [2025-03-16 19:37:04,024 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2182 transitions. Word has length 106 [2025-03-16 19:37:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:04,024 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2182 transitions. [2025-03-16 19:37:04,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 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-16 19:37:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2182 transitions. [2025-03-16 19:37:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:37:04,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:04,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:04,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:37:04,027 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:04,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1329863682, now seen corresponding path program 1 times [2025-03-16 19:37:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089487999] [2025-03-16 19:37:04,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:04,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:37:04,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:37:04,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:04,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:04,298 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-16 19:37:04,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:04,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089487999] [2025-03-16 19:37:04,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089487999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:04,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:04,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:04,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065611857] [2025-03-16 19:37:04,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:04,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:04,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:04,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:04,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:04,299 INFO L87 Difference]: Start difference. First operand 1542 states and 2182 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:05,824 INFO L93 Difference]: Finished difference Result 2783 states and 3956 transitions. [2025-03-16 19:37:05,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:05,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:37:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:05,829 INFO L225 Difference]: With dead ends: 2783 [2025-03-16 19:37:05,829 INFO L226 Difference]: Without dead ends: 2417 [2025-03-16 19:37:05,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:05,830 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 3015 mSDsluCounter, 4058 mSDsCounter, 0 mSdLazyCounter, 4302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3015 SdHoareTripleChecker+Valid, 5293 SdHoareTripleChecker+Invalid, 4305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:05,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3015 Valid, 5293 Invalid, 4305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4302 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:37:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2025-03-16 19:37:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1542. [2025-03-16 19:37:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4408460013218771) internal successors, (2180), 1541 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-16 19:37:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2180 transitions. [2025-03-16 19:37:05,845 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2180 transitions. Word has length 108 [2025-03-16 19:37:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:05,845 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2180 transitions. [2025-03-16 19:37:05,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2180 transitions. [2025-03-16 19:37:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:37:05,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:05,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:05,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:37:05,847 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:05,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:05,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1767538335, now seen corresponding path program 1 times [2025-03-16 19:37:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:05,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637603902] [2025-03-16 19:37:05,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:05,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:37:05,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:37:05,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:05,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:06,039 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-16 19:37:06,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637603902] [2025-03-16 19:37:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637603902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:06,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:06,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86510266] [2025-03-16 19:37:06,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:06,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:06,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:06,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:06,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:06,041 INFO L87 Difference]: Start difference. First operand 1542 states and 2180 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:07,241 INFO L93 Difference]: Finished difference Result 2571 states and 3638 transitions. [2025-03-16 19:37:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:07,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:37:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:07,246 INFO L225 Difference]: With dead ends: 2571 [2025-03-16 19:37:07,246 INFO L226 Difference]: Without dead ends: 2361 [2025-03-16 19:37:07,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:07,247 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 6003 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6003 SdHoareTripleChecker+Valid, 3493 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:07,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6003 Valid, 3493 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2933 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-16 19:37:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1542. [2025-03-16 19:37:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.439524124256444) internal successors, (2178), 1541 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-16 19:37:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2178 transitions. [2025-03-16 19:37:07,266 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2178 transitions. Word has length 108 [2025-03-16 19:37:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:07,266 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2178 transitions. [2025-03-16 19:37:07,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2178 transitions. [2025-03-16 19:37:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:37:07,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:07,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:07,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:37:07,269 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:07,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:07,270 INFO L85 PathProgramCache]: Analyzing trace with hash -166276539, now seen corresponding path program 1 times [2025-03-16 19:37:07,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:07,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141572147] [2025-03-16 19:37:07,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:07,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:37:07,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:37:07,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:07,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:07,623 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-16 19:37:07,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:07,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141572147] [2025-03-16 19:37:07,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141572147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:07,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:07,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:07,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379864643] [2025-03-16 19:37:07,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:07,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:07,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:07,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:07,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:07,625 INFO L87 Difference]: Start difference. First operand 1542 states and 2178 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:09,699 INFO L93 Difference]: Finished difference Result 3421 states and 4904 transitions. [2025-03-16 19:37:09,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:09,699 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:37:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:09,706 INFO L225 Difference]: With dead ends: 3421 [2025-03-16 19:37:09,706 INFO L226 Difference]: Without dead ends: 3137 [2025-03-16 19:37:09,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:09,707 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 8312 mSDsluCounter, 4842 mSDsCounter, 0 mSdLazyCounter, 5261 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8312 SdHoareTripleChecker+Valid, 6177 SdHoareTripleChecker+Invalid, 5559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 5261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:09,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8312 Valid, 6177 Invalid, 5559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 5261 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 19:37:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2025-03-16 19:37:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 1546. [2025-03-16 19:37:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4383651944627553) internal successors, (2182), 1545 states have internal predecessors, (2182), 0 states have call successors, (0), 0 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-16 19:37:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2182 transitions. [2025-03-16 19:37:09,722 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2182 transitions. Word has length 108 [2025-03-16 19:37:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:09,722 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2182 transitions. [2025-03-16 19:37:09,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2182 transitions. [2025-03-16 19:37:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:37:09,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:09,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:09,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:37:09,724 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:09,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 271398114, now seen corresponding path program 1 times [2025-03-16 19:37:09,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:09,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85583324] [2025-03-16 19:37:09,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:09,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:37:09,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:37:09,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:09,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:09,915 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-16 19:37:09,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:09,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85583324] [2025-03-16 19:37:09,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85583324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:09,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:09,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:09,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500126180] [2025-03-16 19:37:09,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:09,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:09,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:09,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:09,916 INFO L87 Difference]: Start difference. First operand 1546 states and 2182 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:11,125 INFO L93 Difference]: Finished difference Result 2604 states and 3691 transitions. [2025-03-16 19:37:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:11,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:37:11,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:11,130 INFO L225 Difference]: With dead ends: 2604 [2025-03-16 19:37:11,130 INFO L226 Difference]: Without dead ends: 2389 [2025-03-16 19:37:11,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:11,132 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 5413 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5413 SdHoareTripleChecker+Valid, 4175 SdHoareTripleChecker+Invalid, 3511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:11,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5413 Valid, 4175 Invalid, 3511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2025-03-16 19:37:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 1546. [2025-03-16 19:37:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4377059986816085) internal successors, (2181), 1545 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-16 19:37:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2181 transitions. [2025-03-16 19:37:11,146 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2181 transitions. Word has length 108 [2025-03-16 19:37:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:11,146 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2181 transitions. [2025-03-16 19:37:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2181 transitions. [2025-03-16 19:37:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:37:11,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:11,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:11,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:37:11,148 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:11,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:11,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1705512107, now seen corresponding path program 1 times [2025-03-16 19:37:11,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:11,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183975520] [2025-03-16 19:37:11,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:11,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:11,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:37:11,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:37:11,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:11,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:11,364 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-16 19:37:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:11,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183975520] [2025-03-16 19:37:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183975520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:11,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:11,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074548351] [2025-03-16 19:37:11,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:11,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:11,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:11,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:11,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:11,365 INFO L87 Difference]: Start difference. First operand 1546 states and 2181 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:12,496 INFO L93 Difference]: Finished difference Result 2596 states and 3682 transitions. [2025-03-16 19:37:12,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:12,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:37:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:12,500 INFO L225 Difference]: With dead ends: 2596 [2025-03-16 19:37:12,500 INFO L226 Difference]: Without dead ends: 2389 [2025-03-16 19:37:12,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:12,501 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 5409 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 3503 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5409 SdHoareTripleChecker+Valid, 4175 SdHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:12,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5409 Valid, 4175 Invalid, 3507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3503 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2025-03-16 19:37:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 1546. [2025-03-16 19:37:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4370468029004615) internal successors, (2180), 1545 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-16 19:37:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2180 transitions. [2025-03-16 19:37:12,513 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2180 transitions. Word has length 108 [2025-03-16 19:37:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:12,513 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2180 transitions. [2025-03-16 19:37:12,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2180 transitions. [2025-03-16 19:37:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:37:12,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:12,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:12,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:37:12,515 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-16 19:37:12,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1032047613, now seen corresponding path program 1 times [2025-03-16 19:37:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:12,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140913362] [2025-03-16 19:37:12,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:12,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:37:12,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:37:12,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:12,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140913362] [2025-03-16 19:37:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140913362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:12,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587174846] [2025-03-16 19:37:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:12,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:12,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:12,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:12,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:12,701 INFO L87 Difference]: Start difference. First operand 1546 states and 2180 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:13,902 INFO L93 Difference]: Finished difference Result 2604 states and 3688 transitions. [2025-03-16 19:37:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:13,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:37:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:13,906 INFO L225 Difference]: With dead ends: 2604 [2025-03-16 19:37:13,906 INFO L226 Difference]: Without dead ends: 2389 [2025-03-16 19:37:13,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:13,906 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 5405 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 3506 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5405 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:13,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5405 Valid, 4160 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3506 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:13,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2025-03-16 19:37:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 1546. [2025-03-16 19:37:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4363876071193145) internal successors, (2179), 1545 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-16 19:37:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2179 transitions. [2025-03-16 19:37:13,918 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2179 transitions. Word has length 108 [2025-03-16 19:37:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:13,919 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2179 transitions. [2025-03-16 19:37:13,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2179 transitions. [2025-03-16 19:37:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:13,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:13,920 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-16 19:37:13,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:37:13,920 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:13,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1994902895, now seen corresponding path program 1 times [2025-03-16 19:37:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920344340] [2025-03-16 19:37:13,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:13,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:13,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:13,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:13,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:14,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-16 19:37:14,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:14,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920344340] [2025-03-16 19:37:14,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920344340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898596476] [2025-03-16 19:37:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:14,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:14,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:14,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:14,089 INFO L87 Difference]: Start difference. First operand 1546 states and 2179 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 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-16 19:37:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:15,140 INFO L93 Difference]: Finished difference Result 2500 states and 3511 transitions. [2025-03-16 19:37:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:15,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 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-16 19:37:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:15,143 INFO L225 Difference]: With dead ends: 2500 [2025-03-16 19:37:15,144 INFO L226 Difference]: Without dead ends: 2317 [2025-03-16 19:37:15,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:15,144 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 5922 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5922 SdHoareTripleChecker+Valid, 3434 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:15,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5922 Valid, 3434 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:37:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-03-16 19:37:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1546. [2025-03-16 19:37:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4357284113381674) internal successors, (2178), 1545 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-16 19:37:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2178 transitions. [2025-03-16 19:37:15,158 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2178 transitions. Word has length 109 [2025-03-16 19:37:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:15,159 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2178 transitions. [2025-03-16 19:37:15,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 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-16 19:37:15,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2178 transitions. [2025-03-16 19:37:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:15,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:15,161 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-16 19:37:15,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:37:15,161 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:15,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash 66048147, now seen corresponding path program 1 times [2025-03-16 19:37:15,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:15,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156815662] [2025-03-16 19:37:15,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:15,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:15,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:15,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:15,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:15,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:15,515 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-16 19:37:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156815662] [2025-03-16 19:37:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156815662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:15,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:15,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:37:15,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293124525] [2025-03-16 19:37:15,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:15,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:37:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:15,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:37:15,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:37:15,516 INFO L87 Difference]: Start difference. First operand 1546 states and 2178 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-16 19:37:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:17,999 INFO L93 Difference]: Finished difference Result 2786 states and 3950 transitions. [2025-03-16 19:37:17,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:37:17,999 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-16 19:37:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:18,003 INFO L225 Difference]: With dead ends: 2786 [2025-03-16 19:37:18,003 INFO L226 Difference]: Without dead ends: 2502 [2025-03-16 19:37:18,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:18,005 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 3064 mSDsluCounter, 9204 mSDsCounter, 0 mSdLazyCounter, 8367 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3064 SdHoareTripleChecker+Valid, 10810 SdHoareTripleChecker+Invalid, 8371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:18,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3064 Valid, 10810 Invalid, 8371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8367 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 19:37:18,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2025-03-16 19:37:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1542. [2025-03-16 19:37:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4362194315928618) internal successors, (2173), 1541 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-16 19:37:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2173 transitions. [2025-03-16 19:37:18,019 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2173 transitions. Word has length 109 [2025-03-16 19:37:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:18,019 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2173 transitions. [2025-03-16 19:37:18,020 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-16 19:37:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2173 transitions. [2025-03-16 19:37:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:18,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:18,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:18,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:37:18,021 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:18,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1867712117, now seen corresponding path program 1 times [2025-03-16 19:37:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17719331] [2025-03-16 19:37:18,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:18,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:18,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:18,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:18,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:18,463 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-16 19:37:18,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:18,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17719331] [2025-03-16 19:37:18,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17719331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:18,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:18,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:18,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078429819] [2025-03-16 19:37:18,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:18,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:18,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:18,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:18,465 INFO L87 Difference]: Start difference. First operand 1542 states and 2173 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:20,727 INFO L93 Difference]: Finished difference Result 3557 states and 5080 transitions. [2025-03-16 19:37:20,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:20,727 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:20,732 INFO L225 Difference]: With dead ends: 3557 [2025-03-16 19:37:20,732 INFO L226 Difference]: Without dead ends: 3137 [2025-03-16 19:37:20,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:20,734 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 8339 mSDsluCounter, 6067 mSDsCounter, 0 mSdLazyCounter, 6311 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8339 SdHoareTripleChecker+Valid, 7379 SdHoareTripleChecker+Invalid, 6615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 6311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:20,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8339 Valid, 7379 Invalid, 6615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 6311 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 19:37:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2025-03-16 19:37:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 1550. [2025-03-16 19:37:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4339250493096647) internal successors, (2181), 1549 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-16 19:37:20,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2181 transitions. [2025-03-16 19:37:20,751 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2181 transitions. Word has length 110 [2025-03-16 19:37:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:20,751 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2181 transitions. [2025-03-16 19:37:20,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2181 transitions. [2025-03-16 19:37:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:20,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:20,752 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:20,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:37:20,753 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:20,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:20,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1626111966, now seen corresponding path program 1 times [2025-03-16 19:37:20,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:20,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365795472] [2025-03-16 19:37:20,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:20,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:20,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:20,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:20,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:20,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:20,959 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-16 19:37:20,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:20,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365795472] [2025-03-16 19:37:20,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365795472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:20,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:20,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:20,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896983937] [2025-03-16 19:37:20,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:20,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:20,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:20,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:20,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:20,960 INFO L87 Difference]: Start difference. First operand 1550 states and 2181 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:22,178 INFO L93 Difference]: Finished difference Result 2673 states and 3776 transitions. [2025-03-16 19:37:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:22,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:22,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:22,186 INFO L225 Difference]: With dead ends: 2673 [2025-03-16 19:37:22,186 INFO L226 Difference]: Without dead ends: 2393 [2025-03-16 19:37:22,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:22,187 INFO L435 NwaCegarLoop]: 1051 mSDtfsCounter, 5071 mSDsluCounter, 3488 mSDsCounter, 0 mSdLazyCounter, 3761 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5071 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 3765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:22,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5071 Valid, 4539 Invalid, 3765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3761 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2025-03-16 19:37:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 1550. [2025-03-16 19:37:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4326101249178171) internal successors, (2179), 1549 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-16 19:37:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2179 transitions. [2025-03-16 19:37:22,200 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2179 transitions. Word has length 110 [2025-03-16 19:37:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:22,201 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2179 transitions. [2025-03-16 19:37:22,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2179 transitions. [2025-03-16 19:37:22,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:22,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:22,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:22,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:37:22,202 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:22,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:22,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1057188461, now seen corresponding path program 1 times [2025-03-16 19:37:22,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:22,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980687573] [2025-03-16 19:37:22,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:22,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:22,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:22,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:22,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:22,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:22,402 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-16 19:37:22,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:22,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980687573] [2025-03-16 19:37:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980687573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:22,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607066535] [2025-03-16 19:37:22,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:22,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:22,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:22,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:22,403 INFO L87 Difference]: Start difference. First operand 1550 states and 2179 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:23,757 INFO L93 Difference]: Finished difference Result 2583 states and 3640 transitions. [2025-03-16 19:37:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:23,761 INFO L225 Difference]: With dead ends: 2583 [2025-03-16 19:37:23,761 INFO L226 Difference]: Without dead ends: 2369 [2025-03-16 19:37:23,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:23,762 INFO L435 NwaCegarLoop]: 1074 mSDtfsCounter, 4472 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 3968 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4472 SdHoareTripleChecker+Valid, 5084 SdHoareTripleChecker+Invalid, 3972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:23,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4472 Valid, 5084 Invalid, 3972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3968 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-16 19:37:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1550. [2025-03-16 19:37:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4312952005259698) internal successors, (2177), 1549 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-16 19:37:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2177 transitions. [2025-03-16 19:37:23,777 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2177 transitions. Word has length 110 [2025-03-16 19:37:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:23,777 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2177 transitions. [2025-03-16 19:37:23,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2177 transitions. [2025-03-16 19:37:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:23,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:23,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:23,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:37:23,779 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:23,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash -224593822, now seen corresponding path program 1 times [2025-03-16 19:37:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397398225] [2025-03-16 19:37:23,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:23,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:23,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:23,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:23,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:24,127 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-16 19:37:24,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:24,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397398225] [2025-03-16 19:37:24,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397398225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:24,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:24,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462431970] [2025-03-16 19:37:24,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:24,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:24,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:24,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:24,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:24,128 INFO L87 Difference]: Start difference. First operand 1550 states and 2177 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:25,840 INFO L93 Difference]: Finished difference Result 3297 states and 4699 transitions. [2025-03-16 19:37:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:25,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:25,845 INFO L225 Difference]: With dead ends: 3297 [2025-03-16 19:37:25,845 INFO L226 Difference]: Without dead ends: 3033 [2025-03-16 19:37:25,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:25,846 INFO L435 NwaCegarLoop]: 1025 mSDtfsCounter, 9931 mSDsluCounter, 3763 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9931 SdHoareTripleChecker+Valid, 4788 SdHoareTripleChecker+Invalid, 4366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:25,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9931 Valid, 4788 Invalid, 4366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 4030 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:37:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2025-03-16 19:37:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 1558. [2025-03-16 19:37:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4290385873119686) internal successors, (2185), 1557 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-16 19:37:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2185 transitions. [2025-03-16 19:37:25,864 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2185 transitions. Word has length 110 [2025-03-16 19:37:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:25,864 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2185 transitions. [2025-03-16 19:37:25,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2185 transitions. [2025-03-16 19:37:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:25,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:25,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:25,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:37:25,866 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:25,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash -793517327, now seen corresponding path program 1 times [2025-03-16 19:37:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245242687] [2025-03-16 19:37:25,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:25,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:25,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:25,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:25,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:26,057 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-16 19:37:26,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:26,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245242687] [2025-03-16 19:37:26,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245242687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:26,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:26,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:26,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960538172] [2025-03-16 19:37:26,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:26,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:26,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:26,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:26,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:26,058 INFO L87 Difference]: Start difference. First operand 1558 states and 2185 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:27,164 INFO L93 Difference]: Finished difference Result 2513 states and 3520 transitions. [2025-03-16 19:37:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:27,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:27,167 INFO L225 Difference]: With dead ends: 2513 [2025-03-16 19:37:27,167 INFO L226 Difference]: Without dead ends: 2329 [2025-03-16 19:37:27,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:27,168 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 5834 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5834 SdHoareTripleChecker+Valid, 3510 SdHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:27,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5834 Valid, 3510 Invalid, 3003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-03-16 19:37:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1558. [2025-03-16 19:37:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4277305428384566) internal successors, (2183), 1557 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-16 19:37:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2183 transitions. [2025-03-16 19:37:27,181 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2183 transitions. Word has length 110 [2025-03-16 19:37:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:27,181 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2183 transitions. [2025-03-16 19:37:27,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2183 transitions. [2025-03-16 19:37:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:27,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:27,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:27,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:37:27,184 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:27,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:27,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1493567009, now seen corresponding path program 1 times [2025-03-16 19:37:27,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:27,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844606536] [2025-03-16 19:37:27,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:27,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:27,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:27,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:27,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:27,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:27,383 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-16 19:37:27,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:27,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844606536] [2025-03-16 19:37:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844606536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:27,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:27,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599872398] [2025-03-16 19:37:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:27,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:27,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:27,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:27,385 INFO L87 Difference]: Start difference. First operand 1558 states and 2183 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:28,645 INFO L93 Difference]: Finished difference Result 2651 states and 3739 transitions. [2025-03-16 19:37:28,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:28,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:28,648 INFO L225 Difference]: With dead ends: 2651 [2025-03-16 19:37:28,648 INFO L226 Difference]: Without dead ends: 2393 [2025-03-16 19:37:28,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:28,649 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 5225 mSDsluCounter, 3353 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5225 SdHoareTripleChecker+Valid, 4359 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:28,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5225 Valid, 4359 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2025-03-16 19:37:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 1558. [2025-03-16 19:37:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4264224983649445) internal successors, (2181), 1557 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-16 19:37:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2181 transitions. [2025-03-16 19:37:28,661 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2181 transitions. Word has length 110 [2025-03-16 19:37:28,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:28,661 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2181 transitions. [2025-03-16 19:37:28,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2181 transitions. [2025-03-16 19:37:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:28,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:28,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:28,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:37:28,663 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -383383964, now seen corresponding path program 1 times [2025-03-16 19:37:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432592962] [2025-03-16 19:37:28,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:28,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:28,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:28,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:28,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:28,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:28,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-16 19:37:28,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432592962] [2025-03-16 19:37:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432592962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:28,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:28,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:28,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443277598] [2025-03-16 19:37:28,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:28,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:28,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:28,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:28,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:28,880 INFO L87 Difference]: Start difference. First operand 1558 states and 2181 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:30,214 INFO L93 Difference]: Finished difference Result 2581 states and 3631 transitions. [2025-03-16 19:37:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:30,217 INFO L225 Difference]: With dead ends: 2581 [2025-03-16 19:37:30,217 INFO L226 Difference]: Without dead ends: 2377 [2025-03-16 19:37:30,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:30,218 INFO L435 NwaCegarLoop]: 1140 mSDtfsCounter, 4462 mSDsluCounter, 4115 mSDsCounter, 0 mSdLazyCounter, 4057 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4462 SdHoareTripleChecker+Valid, 5255 SdHoareTripleChecker+Invalid, 4061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:30,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4462 Valid, 5255 Invalid, 4061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4057 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:30,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-16 19:37:30,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1558. [2025-03-16 19:37:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4251144538914322) internal successors, (2179), 1557 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-16 19:37:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2179 transitions. [2025-03-16 19:37:30,230 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2179 transitions. Word has length 110 [2025-03-16 19:37:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:30,230 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2179 transitions. [2025-03-16 19:37:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2179 transitions. [2025-03-16 19:37:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:30,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:30,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] [2025-03-16 19:37:30,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:37:30,232 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:30,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1435269561, now seen corresponding path program 1 times [2025-03-16 19:37:30,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:30,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661688625] [2025-03-16 19:37:30,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:30,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:30,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:30,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:30,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:30,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661688625] [2025-03-16 19:37:30,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661688625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:30,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:30,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:30,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147953233] [2025-03-16 19:37:30,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:30,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:30,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:30,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:30,404 INFO L87 Difference]: Start difference. First operand 1558 states and 2179 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:31,468 INFO L93 Difference]: Finished difference Result 2411 states and 3338 transitions. [2025-03-16 19:37:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:31,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:31,471 INFO L225 Difference]: With dead ends: 2411 [2025-03-16 19:37:31,471 INFO L226 Difference]: Without dead ends: 2240 [2025-03-16 19:37:31,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:31,472 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 5941 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 2860 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5941 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:31,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5941 Valid, 3186 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2860 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2025-03-16 19:37:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1558. [2025-03-16 19:37:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4244604316546763) internal successors, (2178), 1557 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-16 19:37:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2178 transitions. [2025-03-16 19:37:31,483 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2178 transitions. Word has length 110 [2025-03-16 19:37:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:31,484 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2178 transitions. [2025-03-16 19:37:31,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2178 transitions. [2025-03-16 19:37:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:31,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:31,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:31,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:37:31,485 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:31,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1025167890, now seen corresponding path program 1 times [2025-03-16 19:37:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029451530] [2025-03-16 19:37:31,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:31,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:31,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:31,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:31,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:31,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:31,671 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-16 19:37:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029451530] [2025-03-16 19:37:31,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029451530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:31,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:31,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:31,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857094357] [2025-03-16 19:37:31,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:31,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:31,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:31,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:31,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:31,672 INFO L87 Difference]: Start difference. First operand 1558 states and 2178 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:32,900 INFO L93 Difference]: Finished difference Result 2623 states and 3684 transitions. [2025-03-16 19:37:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:32,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:32,907 INFO L225 Difference]: With dead ends: 2623 [2025-03-16 19:37:32,907 INFO L226 Difference]: Without dead ends: 2393 [2025-03-16 19:37:32,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:32,908 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 3281 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 3774 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3281 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 3777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:32,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3281 Valid, 4530 Invalid, 3777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3774 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2025-03-16 19:37:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 1558. [2025-03-16 19:37:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4238064094179201) internal successors, (2177), 1557 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-16 19:37:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2177 transitions. [2025-03-16 19:37:32,920 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2177 transitions. Word has length 110 [2025-03-16 19:37:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:32,920 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2177 transitions. [2025-03-16 19:37:32,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2177 transitions. [2025-03-16 19:37:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:32,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:32,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:32,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:37:32,921 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:32,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 229823188, now seen corresponding path program 1 times [2025-03-16 19:37:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75838133] [2025-03-16 19:37:32,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:32,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:32,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:32,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:32,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:33,090 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-16 19:37:33,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:33,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75838133] [2025-03-16 19:37:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75838133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:33,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655368382] [2025-03-16 19:37:33,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:33,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:33,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:33,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:33,091 INFO L87 Difference]: Start difference. First operand 1558 states and 2177 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:34,187 INFO L93 Difference]: Finished difference Result 2507 states and 3501 transitions. [2025-03-16 19:37:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:34,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:34,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:34,190 INFO L225 Difference]: With dead ends: 2507 [2025-03-16 19:37:34,190 INFO L226 Difference]: Without dead ends: 2329 [2025-03-16 19:37:34,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:34,191 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 3743 mSDsluCounter, 2735 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3743 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 3039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:34,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3743 Valid, 3566 Invalid, 3039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-03-16 19:37:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1558. [2025-03-16 19:37:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4231523871811642) internal successors, (2176), 1557 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-16 19:37:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2176 transitions. [2025-03-16 19:37:34,203 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2176 transitions. Word has length 110 [2025-03-16 19:37:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:34,203 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2176 transitions. [2025-03-16 19:37:34,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2176 transitions. [2025-03-16 19:37:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:34,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:34,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:34,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:37:34,205 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:34,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1611652830, now seen corresponding path program 1 times [2025-03-16 19:37:34,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:34,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876944703] [2025-03-16 19:37:34,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:34,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:34,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:34,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:34,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:34,522 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-16 19:37:34,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:34,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876944703] [2025-03-16 19:37:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876944703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631409780] [2025-03-16 19:37:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:34,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:34,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:34,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:34,524 INFO L87 Difference]: Start difference. First operand 1558 states and 2176 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:36,291 INFO L93 Difference]: Finished difference Result 3128 states and 4435 transitions. [2025-03-16 19:37:36,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:36,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:36,295 INFO L225 Difference]: With dead ends: 3128 [2025-03-16 19:37:36,295 INFO L226 Difference]: Without dead ends: 2937 [2025-03-16 19:37:36,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:36,296 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 9710 mSDsluCounter, 4018 mSDsCounter, 0 mSdLazyCounter, 4229 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9710 SdHoareTripleChecker+Valid, 5045 SdHoareTripleChecker+Invalid, 4559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 4229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:36,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9710 Valid, 5045 Invalid, 4559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 4229 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:37:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2025-03-16 19:37:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1562. [2025-03-16 19:37:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1533 states have (on average 1.4220482713633398) internal successors, (2180), 1561 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-16 19:37:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2180 transitions. [2025-03-16 19:37:36,313 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2180 transitions. Word has length 110 [2025-03-16 19:37:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:36,313 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2180 transitions. [2025-03-16 19:37:36,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2180 transitions. [2025-03-16 19:37:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:36,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:36,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:36,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:37:36,315 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-16 19:37:36,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash 639367733, now seen corresponding path program 1 times [2025-03-16 19:37:36,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:36,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278248166] [2025-03-16 19:37:36,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:36,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:36,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:36,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:36,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:36,515 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-16 19:37:36,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:36,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278248166] [2025-03-16 19:37:36,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278248166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:36,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:36,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:36,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697363456] [2025-03-16 19:37:36,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:36,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:36,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:36,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:36,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:36,517 INFO L87 Difference]: Start difference. First operand 1562 states and 2180 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:37,854 INFO L93 Difference]: Finished difference Result 2562 states and 3596 transitions. [2025-03-16 19:37:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:37,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:37,856 INFO L225 Difference]: With dead ends: 2562 [2025-03-16 19:37:37,856 INFO L226 Difference]: Without dead ends: 2377 [2025-03-16 19:37:37,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:37,857 INFO L435 NwaCegarLoop]: 1185 mSDtfsCounter, 4448 mSDsluCounter, 4205 mSDsCounter, 0 mSdLazyCounter, 4088 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4448 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 4092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:37,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4448 Valid, 5390 Invalid, 4092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4088 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-16 19:37:37,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1562. [2025-03-16 19:37:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1533 states have (on average 1.421395955642531) internal successors, (2179), 1561 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-16 19:37:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2179 transitions. [2025-03-16 19:37:37,870 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2179 transitions. Word has length 110 [2025-03-16 19:37:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:37,870 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2179 transitions. [2025-03-16 19:37:37,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2179 transitions. [2025-03-16 19:37:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:37,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:37,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:37,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:37:37,872 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:37,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1136831847, now seen corresponding path program 1 times [2025-03-16 19:37:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:37,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001089612] [2025-03-16 19:37:37,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:37,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:37,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:37,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:37,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:37,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:38,034 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-16 19:37:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:38,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001089612] [2025-03-16 19:37:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001089612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:38,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921062172] [2025-03-16 19:37:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:38,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:38,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:38,036 INFO L87 Difference]: Start difference. First operand 1562 states and 2179 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:39,239 INFO L93 Difference]: Finished difference Result 2560 states and 3593 transitions. [2025-03-16 19:37:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:39,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:39,242 INFO L225 Difference]: With dead ends: 2560 [2025-03-16 19:37:39,242 INFO L226 Difference]: Without dead ends: 2377 [2025-03-16 19:37:39,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:39,243 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 4943 mSDsluCounter, 3507 mSDsCounter, 0 mSdLazyCounter, 3781 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4943 SdHoareTripleChecker+Valid, 4574 SdHoareTripleChecker+Invalid, 3784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:39,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4943 Valid, 4574 Invalid, 3784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3781 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-16 19:37:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1562. [2025-03-16 19:37:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1533 states have (on average 1.4207436399217221) internal successors, (2178), 1561 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-16 19:37:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2178 transitions. [2025-03-16 19:37:39,256 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2178 transitions. Word has length 110 [2025-03-16 19:37:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:39,257 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2178 transitions. [2025-03-16 19:37:39,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:39,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2178 transitions. [2025-03-16 19:37:39,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:39,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:39,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:39,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:37:39,259 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-16 19:37:39,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash -242850635, now seen corresponding path program 1 times [2025-03-16 19:37:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83980366] [2025-03-16 19:37:39,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:39,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:39,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:39,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:39,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:39,423 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-16 19:37:39,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:39,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83980366] [2025-03-16 19:37:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83980366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:39,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:39,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:39,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927254757] [2025-03-16 19:37:39,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:39,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:39,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:39,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:39,425 INFO L87 Difference]: Start difference. First operand 1562 states and 2178 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:40,589 INFO L93 Difference]: Finished difference Result 2562 states and 3594 transitions. [2025-03-16 19:37:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:40,592 INFO L225 Difference]: With dead ends: 2562 [2025-03-16 19:37:40,592 INFO L226 Difference]: Without dead ends: 2377 [2025-03-16 19:37:40,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:40,593 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 5134 mSDsluCounter, 3344 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 4357 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:40,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 4357 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-16 19:37:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1562. [2025-03-16 19:37:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1533 states have (on average 1.4200913242009132) internal successors, (2177), 1561 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-16 19:37:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2177 transitions. [2025-03-16 19:37:40,606 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2177 transitions. Word has length 110 [2025-03-16 19:37:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:40,606 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2177 transitions. [2025-03-16 19:37:40,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2177 transitions. [2025-03-16 19:37:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:40,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:40,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:40,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:37:40,607 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:40,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -92567293, now seen corresponding path program 1 times [2025-03-16 19:37:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886381460] [2025-03-16 19:37:40,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:40,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:40,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:40,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:40,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:40,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:40,890 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-16 19:37:40,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:40,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886381460] [2025-03-16 19:37:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886381460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:40,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:40,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:40,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284307209] [2025-03-16 19:37:40,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:40,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:40,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:40,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:40,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:40,891 INFO L87 Difference]: Start difference. First operand 1562 states and 2177 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:42,629 INFO L93 Difference]: Finished difference Result 3128 states and 4429 transitions. [2025-03-16 19:37:42,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:42,629 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:42,632 INFO L225 Difference]: With dead ends: 3128 [2025-03-16 19:37:42,632 INFO L226 Difference]: Without dead ends: 2937 [2025-03-16 19:37:42,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:42,633 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 9795 mSDsluCounter, 3967 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9795 SdHoareTripleChecker+Valid, 4977 SdHoareTripleChecker+Invalid, 4479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:42,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9795 Valid, 4977 Invalid, 4479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:37:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2025-03-16 19:37:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1566. [2025-03-16 19:37:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1537 states have (on average 1.4189980481457385) internal successors, (2181), 1565 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-16 19:37:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2181 transitions. [2025-03-16 19:37:42,647 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2181 transitions. Word has length 110 [2025-03-16 19:37:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:42,647 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2181 transitions. [2025-03-16 19:37:42,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2181 transitions. [2025-03-16 19:37:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:42,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:42,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:42,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:37:42,649 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:42,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:42,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2136778195, now seen corresponding path program 1 times [2025-03-16 19:37:42,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:42,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86357487] [2025-03-16 19:37:42,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:42,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:42,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:42,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:42,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:42,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:42,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:42,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86357487] [2025-03-16 19:37:42,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86357487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:42,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:42,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:42,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524083173] [2025-03-16 19:37:42,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:42,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:42,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:42,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:42,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:42,848 INFO L87 Difference]: Start difference. First operand 1566 states and 2181 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:44,147 INFO L93 Difference]: Finished difference Result 2562 states and 3591 transitions. [2025-03-16 19:37:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:44,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:44,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:44,150 INFO L225 Difference]: With dead ends: 2562 [2025-03-16 19:37:44,150 INFO L226 Difference]: Without dead ends: 2377 [2025-03-16 19:37:44,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:44,151 INFO L435 NwaCegarLoop]: 1150 mSDtfsCounter, 4439 mSDsluCounter, 4154 mSDsCounter, 0 mSdLazyCounter, 4016 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4439 SdHoareTripleChecker+Valid, 5304 SdHoareTripleChecker+Invalid, 4020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:44,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4439 Valid, 5304 Invalid, 4020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4016 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:44,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-03-16 19:37:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1566. [2025-03-16 19:37:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1537 states have (on average 1.4183474300585557) internal successors, (2180), 1565 states have internal predecessors, (2180), 0 states have call successors, (0), 0 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-16 19:37:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2180 transitions. [2025-03-16 19:37:44,162 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2180 transitions. Word has length 110 [2025-03-16 19:37:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:44,162 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2180 transitions. [2025-03-16 19:37:44,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2180 transitions. [2025-03-16 19:37:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:44,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:44,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:44,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:37:44,163 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:44,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 45043908, now seen corresponding path program 1 times [2025-03-16 19:37:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:44,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033315962] [2025-03-16 19:37:44,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:44,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:44,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:44,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:44,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:44,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:44,341 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-16 19:37:44,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033315962] [2025-03-16 19:37:44,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033315962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:44,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:44,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:44,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001272405] [2025-03-16 19:37:44,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:44,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:44,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:44,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:44,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:44,342 INFO L87 Difference]: Start difference. First operand 1566 states and 2180 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:45,581 INFO L93 Difference]: Finished difference Result 2669 states and 3738 transitions. [2025-03-16 19:37:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:45,584 INFO L225 Difference]: With dead ends: 2669 [2025-03-16 19:37:45,584 INFO L226 Difference]: Without dead ends: 2405 [2025-03-16 19:37:45,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:37:45,584 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 5034 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5034 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 3699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:45,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5034 Valid, 4524 Invalid, 3699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3695 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2025-03-16 19:37:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1558. [2025-03-16 19:37:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1529 states have (on average 1.4192282537606278) internal successors, (2170), 1557 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2170 transitions. [2025-03-16 19:37:45,609 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2170 transitions. Word has length 111 [2025-03-16 19:37:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:45,609 INFO L471 AbstractCegarLoop]: Abstraction has 1558 states and 2170 transitions. [2025-03-16 19:37:45,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2170 transitions. [2025-03-16 19:37:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:45,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:45,610 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-16 19:37:45,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:37:45,610 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:45,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2062230116, now seen corresponding path program 1 times [2025-03-16 19:37:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:45,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441665354] [2025-03-16 19:37:45,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:45,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:45,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:45,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:45,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:45,900 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-16 19:37:45,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:45,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441665354] [2025-03-16 19:37:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441665354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:45,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:45,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:37:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800366471] [2025-03-16 19:37:45,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:45,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:37:45,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:45,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:37:45,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:37:45,901 INFO L87 Difference]: Start difference. First operand 1558 states and 2170 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-16 19:37:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:48,303 INFO L93 Difference]: Finished difference Result 2934 states and 4117 transitions. [2025-03-16 19:37:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:37:48,303 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-16 19:37:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:48,306 INFO L225 Difference]: With dead ends: 2934 [2025-03-16 19:37:48,306 INFO L226 Difference]: Without dead ends: 2514 [2025-03-16 19:37:48,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:48,307 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 3858 mSDsluCounter, 8466 mSDsCounter, 0 mSdLazyCounter, 7560 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3858 SdHoareTripleChecker+Valid, 10079 SdHoareTripleChecker+Invalid, 7566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:48,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3858 Valid, 10079 Invalid, 7566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7560 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 19:37:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2025-03-16 19:37:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 1550. [2025-03-16 19:37:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4201183431952662) internal successors, (2160), 1549 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-16 19:37:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2160 transitions. [2025-03-16 19:37:48,320 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2160 transitions. Word has length 111 [2025-03-16 19:37:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:48,321 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2160 transitions. [2025-03-16 19:37:48,321 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-16 19:37:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2160 transitions. [2025-03-16 19:37:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:48,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:48,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, 1, 1] [2025-03-16 19:37:48,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:37:48,322 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:48,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1127877571, now seen corresponding path program 1 times [2025-03-16 19:37:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264198392] [2025-03-16 19:37:48,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:48,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:48,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:48,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:48,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264198392] [2025-03-16 19:37:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264198392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305360332] [2025-03-16 19:37:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:48,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:48,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:48,499 INFO L87 Difference]: Start difference. First operand 1550 states and 2160 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:49,725 INFO L93 Difference]: Finished difference Result 2552 states and 3576 transitions. [2025-03-16 19:37:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:49,728 INFO L225 Difference]: With dead ends: 2552 [2025-03-16 19:37:49,728 INFO L226 Difference]: Without dead ends: 2361 [2025-03-16 19:37:49,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:49,729 INFO L435 NwaCegarLoop]: 1060 mSDtfsCounter, 4953 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 3715 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4953 SdHoareTripleChecker+Valid, 4545 SdHoareTripleChecker+Invalid, 3719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:49,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4953 Valid, 4545 Invalid, 3719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3715 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-16 19:37:49,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1546. [2025-03-16 19:37:49,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1517 states have (on average 1.4205669083717865) internal successors, (2155), 1545 states have internal predecessors, (2155), 0 states have call successors, (0), 0 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-16 19:37:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2155 transitions. [2025-03-16 19:37:49,741 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2155 transitions. Word has length 111 [2025-03-16 19:37:49,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:49,741 INFO L471 AbstractCegarLoop]: Abstraction has 1546 states and 2155 transitions. [2025-03-16 19:37:49,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:49,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2155 transitions. [2025-03-16 19:37:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:49,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:49,743 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-16 19:37:49,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:37:49,743 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:49,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash 974888298, now seen corresponding path program 1 times [2025-03-16 19:37:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:49,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365477955] [2025-03-16 19:37:49,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:49,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:49,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:49,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:49,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:49,916 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-16 19:37:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:49,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365477955] [2025-03-16 19:37:49,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365477955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:49,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:49,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093308273] [2025-03-16 19:37:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:49,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:49,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:49,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:49,917 INFO L87 Difference]: Start difference. First operand 1546 states and 2155 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:51,189 INFO L93 Difference]: Finished difference Result 2552 states and 3574 transitions. [2025-03-16 19:37:51,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:51,189 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:51,191 INFO L225 Difference]: With dead ends: 2552 [2025-03-16 19:37:51,191 INFO L226 Difference]: Without dead ends: 2361 [2025-03-16 19:37:51,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:51,192 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 3232 mSDsluCounter, 3536 mSDsCounter, 0 mSdLazyCounter, 3775 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3232 SdHoareTripleChecker+Valid, 4613 SdHoareTripleChecker+Invalid, 3779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:51,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3232 Valid, 4613 Invalid, 3779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3775 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2025-03-16 19:37:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 1542. [2025-03-16 19:37:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1513 states have (on average 1.4210178453403834) internal successors, (2150), 1541 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-16 19:37:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2150 transitions. [2025-03-16 19:37:51,203 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2150 transitions. Word has length 111 [2025-03-16 19:37:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:51,203 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2150 transitions. [2025-03-16 19:37:51,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 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-16 19:37:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2150 transitions. [2025-03-16 19:37:51,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:51,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:51,205 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-16 19:37:51,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:37:51,205 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:51,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1239981171, now seen corresponding path program 1 times [2025-03-16 19:37:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:51,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592981705] [2025-03-16 19:37:51,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:51,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:51,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:51,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:51,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:51,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592981705] [2025-03-16 19:37:51,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592981705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:51,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:51,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812993197] [2025-03-16 19:37:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:51,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:51,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:51,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:51,487 INFO L87 Difference]: Start difference. First operand 1542 states and 2150 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 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-16 19:37:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:53,264 INFO L93 Difference]: Finished difference Result 2981 states and 4199 transitions. [2025-03-16 19:37:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:53,265 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 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-16 19:37:53,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:53,267 INFO L225 Difference]: With dead ends: 2981 [2025-03-16 19:37:53,267 INFO L226 Difference]: Without dead ends: 2793 [2025-03-16 19:37:53,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:53,268 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 9980 mSDsluCounter, 4159 mSDsCounter, 0 mSdLazyCounter, 4398 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9980 SdHoareTripleChecker+Valid, 5077 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 4398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:53,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9980 Valid, 5077 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 4398 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:37:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2025-03-16 19:37:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 1550. [2025-03-16 19:37:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4188034188034189) internal successors, (2158), 1549 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-16 19:37:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2158 transitions. [2025-03-16 19:37:53,282 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2158 transitions. Word has length 112 [2025-03-16 19:37:53,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:53,283 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2158 transitions. [2025-03-16 19:37:53,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 10 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-16 19:37:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2158 transitions. [2025-03-16 19:37:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:53,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:53,284 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-16 19:37:53,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:37:53,284 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:53,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1070930902, now seen corresponding path program 1 times [2025-03-16 19:37:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:53,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745615441] [2025-03-16 19:37:53,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:53,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:53,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:53,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:53,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:53,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745615441] [2025-03-16 19:37:53,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745615441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:53,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:53,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855015935] [2025-03-16 19:37:53,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:53,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:53,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:53,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:53,476 INFO L87 Difference]: Start difference. First operand 1550 states and 2158 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:54,718 INFO L93 Difference]: Finished difference Result 2495 states and 3478 transitions. [2025-03-16 19:37:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:54,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:54,720 INFO L225 Difference]: With dead ends: 2495 [2025-03-16 19:37:54,720 INFO L226 Difference]: Without dead ends: 2313 [2025-03-16 19:37:54,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:54,721 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 4522 mSDsluCounter, 3791 mSDsCounter, 0 mSdLazyCounter, 3812 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 4810 SdHoareTripleChecker+Invalid, 3816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:54,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 4810 Invalid, 3816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3812 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2025-03-16 19:37:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 1550. [2025-03-16 19:37:54,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4174884944115713) internal successors, (2156), 1549 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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-16 19:37:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2156 transitions. [2025-03-16 19:37:54,731 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2156 transitions. Word has length 112 [2025-03-16 19:37:54,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:54,731 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2156 transitions. [2025-03-16 19:37:54,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2156 transitions. [2025-03-16 19:37:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:54,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:54,733 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-16 19:37:54,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:37:54,733 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:54,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1261891778, now seen corresponding path program 1 times [2025-03-16 19:37:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252037645] [2025-03-16 19:37:54,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:54,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:54,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:54,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:54,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:54,890 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-16 19:37:54,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252037645] [2025-03-16 19:37:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252037645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:54,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:54,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541681648] [2025-03-16 19:37:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:54,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:54,891 INFO L87 Difference]: Start difference. First operand 1550 states and 2156 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:56,117 INFO L93 Difference]: Finished difference Result 2591 states and 3621 transitions. [2025-03-16 19:37:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:56,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:56,119 INFO L225 Difference]: With dead ends: 2591 [2025-03-16 19:37:56,119 INFO L226 Difference]: Without dead ends: 2369 [2025-03-16 19:37:56,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:56,120 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 2995 mSDsluCounter, 4115 mSDsCounter, 0 mSdLazyCounter, 4007 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2995 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 4010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:56,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2995 Valid, 5500 Invalid, 4010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4007 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:56,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-16 19:37:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1550. [2025-03-16 19:37:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4161735700197238) internal successors, (2154), 1549 states have internal predecessors, (2154), 0 states have call successors, (0), 0 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-16 19:37:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2154 transitions. [2025-03-16 19:37:56,131 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2154 transitions. Word has length 112 [2025-03-16 19:37:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:56,131 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2154 transitions. [2025-03-16 19:37:56,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2154 transitions. [2025-03-16 19:37:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:56,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:56,132 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-16 19:37:56,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:37:56,132 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1035470581, now seen corresponding path program 1 times [2025-03-16 19:37:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204556663] [2025-03-16 19:37:56,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:56,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:56,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:56,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:56,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:56,292 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-16 19:37:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:56,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204556663] [2025-03-16 19:37:56,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204556663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:56,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:56,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679772931] [2025-03-16 19:37:56,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:56,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:56,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:56,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:56,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:56,293 INFO L87 Difference]: Start difference. First operand 1550 states and 2154 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:57,293 INFO L93 Difference]: Finished difference Result 2406 states and 3317 transitions. [2025-03-16 19:37:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:57,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:57,295 INFO L225 Difference]: With dead ends: 2406 [2025-03-16 19:37:57,295 INFO L226 Difference]: Without dead ends: 2232 [2025-03-16 19:37:57,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:57,296 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 5833 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 2864 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5833 SdHoareTripleChecker+Valid, 3243 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:57,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5833 Valid, 3243 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2864 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:37:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2025-03-16 19:37:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 1550. [2025-03-16 19:37:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4148586456278764) internal successors, (2152), 1549 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-16 19:37:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2152 transitions. [2025-03-16 19:37:57,306 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2152 transitions. Word has length 112 [2025-03-16 19:37:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:57,306 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2152 transitions. [2025-03-16 19:37:57,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2152 transitions. [2025-03-16 19:37:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:57,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:57,308 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-16 19:37:57,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:37:57,308 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:57,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash 971863861, now seen corresponding path program 1 times [2025-03-16 19:37:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:57,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640151283] [2025-03-16 19:37:57,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:57,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:57,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:57,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:57,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:57,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640151283] [2025-03-16 19:37:57,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640151283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794849770] [2025-03-16 19:37:57,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:57,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:57,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:57,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:57,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:57,476 INFO L87 Difference]: Start difference. First operand 1550 states and 2152 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:58,641 INFO L93 Difference]: Finished difference Result 2689 states and 3752 transitions. [2025-03-16 19:37:58,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:58,644 INFO L225 Difference]: With dead ends: 2689 [2025-03-16 19:37:58,644 INFO L226 Difference]: Without dead ends: 2393 [2025-03-16 19:37:58,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:58,645 INFO L435 NwaCegarLoop]: 1529 mSDtfsCounter, 4320 mSDsluCounter, 3986 mSDsCounter, 0 mSdLazyCounter, 3817 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4320 SdHoareTripleChecker+Valid, 5515 SdHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:58,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4320 Valid, 5515 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3817 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2025-03-16 19:37:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 1550. [2025-03-16 19:37:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.413543721236029) internal successors, (2150), 1549 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-16 19:37:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2150 transitions. [2025-03-16 19:37:58,655 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2150 transitions. Word has length 112 [2025-03-16 19:37:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:58,655 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2150 transitions. [2025-03-16 19:37:58,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:37:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2150 transitions. [2025-03-16 19:37:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:58,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:58,656 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-16 19:37:58,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 19:37:58,656 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:58,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:58,657 INFO L85 PathProgramCache]: Analyzing trace with hash 551970044, now seen corresponding path program 1 times [2025-03-16 19:37:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603984912] [2025-03-16 19:37:58,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:58,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:58,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:58,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:58,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:58,836 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-16 19:37:58,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603984912] [2025-03-16 19:37:58,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603984912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:58,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:58,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:58,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219193188] [2025-03-16 19:37:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:58,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:58,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:58,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:58,837 INFO L87 Difference]: Start difference. First operand 1550 states and 2150 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:38:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:38:00,156 INFO L93 Difference]: Finished difference Result 2591 states and 3611 transitions. [2025-03-16 19:38:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:38:00,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:38:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:38:00,159 INFO L225 Difference]: With dead ends: 2591 [2025-03-16 19:38:00,159 INFO L226 Difference]: Without dead ends: 2369 [2025-03-16 19:38:00,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:38:00,159 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 4405 mSDsluCounter, 4580 mSDsCounter, 0 mSdLazyCounter, 4282 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4405 SdHoareTripleChecker+Valid, 5969 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:38:00,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4405 Valid, 5969 Invalid, 4286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4282 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:38:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-03-16 19:38:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1550. [2025-03-16 19:38:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1521 states have (on average 1.4122287968441816) internal successors, (2148), 1549 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-16 19:38:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2148 transitions. [2025-03-16 19:38:00,170 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2148 transitions. Word has length 112 [2025-03-16 19:38:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:00,170 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2148 transitions. [2025-03-16 19:38:00,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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-16 19:38:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2148 transitions. [2025-03-16 19:38:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:38:00,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:00,171 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-16 19:38:00,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 19:38:00,172 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:38:00,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash 778391241, now seen corresponding path program 1 times [2025-03-16 19:38:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349078356] [2025-03-16 19:38:00,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:00,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:38:00,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:38:00,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:00,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:00,345 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-16 19:38:00,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:00,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349078356] [2025-03-16 19:38:00,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349078356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:00,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:38:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311177889] [2025-03-16 19:38:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:00,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:38:00,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:00,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:38:00,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:38:00,346 INFO L87 Difference]: Start difference. First operand 1550 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 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)