./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.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 438134aaa8cbf7b10a3435da62ff5e9b4dd424421597a948889467a2e9f2184b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:29:11,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:29:11,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:29:11,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:29:11,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:29:11,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:29:11,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:29:11,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:29:11,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:29:11,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:29:11,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:29:11,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:29:11,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:29:11,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:29:11,237 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:29:11,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:29:11,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:29:11,238 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:29:11,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:29:11,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:29:11,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:29:11,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:29:11,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:29:11,239 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:29:11,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:11,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:29:11,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:29:11,241 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 -> 438134aaa8cbf7b10a3435da62ff5e9b4dd424421597a948889467a2e9f2184b [2025-03-08 06:29:11,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:29:11,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:29:11,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:29:11,472 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:29:11,472 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:29:11,473 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-03-08 06:29:12,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a314ddfe0/cc68130bb42040c583e48b4065c5145e/FLAG83fa10884 [2025-03-08 06:29:13,163 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:29:13,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-03-08 06:29:13,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a314ddfe0/cc68130bb42040c583e48b4065c5145e/FLAG83fa10884 [2025-03-08 06:29:13,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a314ddfe0/cc68130bb42040c583e48b4065c5145e [2025-03-08 06:29:13,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:29:13,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:29:13,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:13,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:29:13,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:29:13,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:29:13" (1/1) ... [2025-03-08 06:29:13,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6affc640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:13, skipping insertion in model container [2025-03-08 06:29:13,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:29:13" (1/1) ... [2025-03-08 06:29:13,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:29:14,139 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17602,17615] [2025-03-08 06:29:14,163 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22899,22912] [2025-03-08 06:29:14,168 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24256,24269] [2025-03-08 06:29:14,171 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25064,25077] [2025-03-08 06:29:14,177 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26792,26805] [2025-03-08 06:29:14,181 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27600,27613] [2025-03-08 06:29:14,187 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28779,28792] [2025-03-08 06:29:14,195 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31519,31532] [2025-03-08 06:29:14,198 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32330,32343] [2025-03-08 06:29:14,202 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33512,33525] [2025-03-08 06:29:14,208 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35703,35716] [2025-03-08 06:29:14,219 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39963,39976] [2025-03-08 06:29:14,222 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40774,40787] [2025-03-08 06:29:14,226 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41956,41969] [2025-03-08 06:29:14,232 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44147,44160] [2025-03-08 06:29:14,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47858,47871] [2025-03-08 06:29:14,262 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54605,54618] [2025-03-08 06:29:14,265 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55416,55429] [2025-03-08 06:29:14,268 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56559,56572] [2025-03-08 06:29:14,274 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58711,58724] [2025-03-08 06:29:14,284 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62628,62641] [2025-03-08 06:29:14,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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69577,69590] [2025-03-08 06:29:14,330 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82313,82326] [2025-03-08 06:29:14,333 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83124,83137] [2025-03-08 06:29:14,336 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84306,84319] [2025-03-08 06:29:14,342 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86497,86510] [2025-03-08 06:29:14,351 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90208,90221] [2025-03-08 06:29:14,364 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96406,96419] [2025-03-08 06:29:14,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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[106997,107010] [2025-03-08 06:29:14,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:14,752 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:29:14,807 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17602,17615] [2025-03-08 06:29:14,815 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22899,22912] [2025-03-08 06:29:14,819 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24256,24269] [2025-03-08 06:29:14,821 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25064,25077] [2025-03-08 06:29:14,825 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26792,26805] [2025-03-08 06:29:14,829 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27600,27613] [2025-03-08 06:29:14,831 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28779,28792] [2025-03-08 06:29:14,837 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31519,31532] [2025-03-08 06:29:14,839 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32330,32343] [2025-03-08 06:29:14,842 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33512,33525] [2025-03-08 06:29:14,846 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35703,35716] [2025-03-08 06:29:14,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39963,39976] [2025-03-08 06:29:14,857 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40774,40787] [2025-03-08 06:29:14,859 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41956,41969] [2025-03-08 06:29:14,864 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44147,44160] [2025-03-08 06:29:14,873 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47858,47871] [2025-03-08 06:29:14,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54605,54618] [2025-03-08 06:29:14,886 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55416,55429] [2025-03-08 06:29:14,889 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56559,56572] [2025-03-08 06:29:14,895 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58711,58724] [2025-03-08 06:29:14,902 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62628,62641] [2025-03-08 06:29:14,915 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69577,69590] [2025-03-08 06:29:14,937 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82313,82326] [2025-03-08 06:29:14,941 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83124,83137] [2025-03-08 06:29:14,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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84306,84319] [2025-03-08 06:29:14,950 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86497,86510] [2025-03-08 06:29:14,956 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90208,90221] [2025-03-08 06:29:14,967 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96406,96419] [2025-03-08 06:29:14,984 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.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[106997,107010] [2025-03-08 06:29:15,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:29:15,298 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:29:15,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15 WrapperNode [2025-03-08 06:29:15,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:29:15,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:15,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:29:15,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:29:15,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,524 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13512 [2025-03-08 06:29:15,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:29:15,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:29:15,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:29:15,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:29:15,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,635 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:29:15,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:29:15,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:29:15,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:29:15,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:29:15,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (1/1) ... [2025-03-08 06:29:15,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:29:15,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:29:15,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:29:15,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:29:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:29:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:29:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:29:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:29:16,172 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:29:16,174 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:29:20,402 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14239: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~121#1; [2025-03-08 06:29:20,403 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5783: havoc main_~check__tmp~47#1; [2025-03-08 06:29:20,403 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9747: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~74#1; [2025-03-08 06:29:20,403 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17675: havoc main_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~157#1; [2025-03-08 06:29:20,403 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9220: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~34#1; [2025-03-08 06:29:20,403 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20055: havoc main_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~182#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13977: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~91#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8428: havoc main_~node6__m6~31#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7371: havoc main_~node6__m6~26#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12656: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~43#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16092: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~52#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3144: havoc main_~check__tmp~25#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20849: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~127#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881: havoc main_~check__tmp~22#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4204: havoc main_~check__tmp~36#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19531: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14775: havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~127#1; [2025-03-08 06:29:20,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10283: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~80#1; [2025-03-08 06:29:20,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:29:20,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:29:20,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356: havoc main_~check__tmp~16#1;havoc main_~node7__m7~9#1; [2025-03-08 06:29:20,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1564: havoc main_~node6__m6~3#1; [2025-03-08 06:29:20,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5528: havoc main_~node5__m5~10#1; [2025-03-08 06:29:20,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1037: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:20,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5266: havoc main_~node6__m6~17#1; [2025-03-08 06:29:20,405 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2096: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11874: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15047: havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~129#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8443: havoc main_~node7__m7~60#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7386: havoc main_~node7__m7~50#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18221: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~113#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9237: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~66#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12673: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~84#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16109: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~102#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10561: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~73#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16639: havoc main_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~146#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12147: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~99#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6334: havoc main_~node6__m6~21#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17433: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~109#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15583: havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~135#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19019: havoc main_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~171#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10035: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~77#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19548: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~61#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L786: havoc main_~node2__m2~2#1; [2025-03-08 06:29:20,406 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1579: havoc main_~node7__m7~4#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5543: havoc main_~node6__m6~18#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7658: havoc main_~check__tmp~63#1;havoc main_~node7__m7~52#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12415: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~102#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5281: havoc main_~node7__m7~32#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19287: havoc main_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~174#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11359: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~91#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13209: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~87#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13739: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~116#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17175: havoc main_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~152#1; [2025-03-08 06:29:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20611: havoc main_~main____CPAchecker_TMP_0~125#1;havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~188#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11891: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3699: havoc main_~node7__m7~19#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11627: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~94#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18763: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14536: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11103: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2650: havoc main_~node7__m7~11#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7143: havoc main_~node6__m6~25#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L801: havoc main_~node3__m3~2#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5558: havoc main_~node7__m7~34#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6615: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~55#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19565: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~120#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6089: havoc main_~node5__m5~11#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17981: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-08 06:29:20,408 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6883: havoc main_~node7__m7~45#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13491: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~113#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8999: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~66#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16927: havoc main_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~149#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4772: havoc main_~check__tmp~41#1;havoc main_~node7__m7~27#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20363: havoc main_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~185#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9793: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~69#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15871: havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~138#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8208: havoc main_~node4__m4~9#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11908: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~41#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7944: havoc main_~node7__m7~55#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20101: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~123#1; [2025-03-08 06:29:20,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15344: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~50#1; [2025-03-08 06:29:20,410 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18780: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~59#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14553: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~94#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2135: havoc main_~check__tmp~13#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14027: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~119#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11120: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~39#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9535: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~72#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12971: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~108#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20899: havoc main_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~191#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7158: havoc main_~node7__m7~48#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16407: havoc main_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~144#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: havoc main_~node4__m4~2#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6104: havoc main_~node6__m6~20#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7426: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~60#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5841: havoc main_~node6__m6~19#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17998: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880: havoc main_~node5__m5~3#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1352: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8223: havoc main_~node5__m5~16#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10338: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3997: havoc main_~check__tmp~34#1;havoc main_~node7__m7~21#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11925: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~80#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15361: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~98#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18797: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~116#1; [2025-03-08 06:29:20,411 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6378: havoc main_~check__tmp~54#1;havoc main_~node7__m7~40#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16685: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~105#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18271: havoc main_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~163#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9287: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~69#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L831: havoc main_~node5__m5~2#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11137: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~76#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12723: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~105#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16159: havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~141#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3739: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5061: havoc main_~node5__m5~9#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10611: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~83#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12461: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~83#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6119: havoc main_~node7__m7~38#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18539: havoc main_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~166#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3213: havoc main_~check__tmp~26#1;havoc main_~node7__m7~15#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19333: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~119#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17483: havoc main_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~155#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5856: havoc main_~node7__m7~36#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2950: havoc main_~check__tmp~23#1;havoc main_~node7__m7~13#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19863: havoc main_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~180#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10879: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~86#1; [2025-03-08 06:29:20,412 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14315: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~122#1; [2025-03-08 06:29:20,413 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4273: havoc main_~check__tmp~37#1;havoc main_~node7__m7~23#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895: havoc main_~node6__m6~4#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17751: havoc main_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~158#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8766: havoc main_~node7__m7~64#1;havoc main_~node6__m6~33#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18015: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11673: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~79#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8238: havoc main_~node6__m6~30#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13259: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~111#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13788: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~46#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2690: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6654: havoc main_~check__tmp~56#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20660: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~64#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10355: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17227: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8508: havoc main_~node7__m7~61#1; [2025-03-08 06:29:20,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14851: havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~128#1; [2025-03-08 06:29:20,415 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L846: havoc main_~node6__m6~2#1; [2025-03-08 06:29:20,415 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5076: havoc main_~node6__m6~16#1; [2025-03-08 06:29:20,415 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5606: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~44#1; [2025-03-08 06:29:20,415 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7721: havoc main_~node7__m7~53#1; [2025-03-08 06:29:20,415 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494: havoc main_~node3__m3~3#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~65#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15123: havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~130#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910: havoc main_~node7__m7~6#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19615: havoc main_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~177#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5346: havoc main_~node7__m7~33#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15917: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~101#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18032: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~57#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13805: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~90#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20677: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~126#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7464: havoc main_~check__tmp~61#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9843: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~75#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10372: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~37#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20151: havoc main_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~183#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12223: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~100#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17244: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~55#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15659: havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~136#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19095: havoc main_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~172#1; [2025-03-08 06:29:20,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14603: havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~125#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10111: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~78#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L864: havoc main_~node7__m7~2#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13020: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~44#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11435: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~92#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7207: havoc main_~node7__m7~49#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9587: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3509: havoc main_~node4__m4~4#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3777: havoc main_~check__tmp~31#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16462: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1400: havoc main_~node7__m7~3#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2193: havoc main_~node6__m6~5#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18049: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~112#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2459: havoc main_~node4__m4~3#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6159: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~51#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5896: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~48#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10389: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~72#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11975: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~97#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15411: havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~133#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17261: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~108#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6427: havoc main_~node7__m7~41#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18847: havoc main_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~169#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: havoc main_~check__tmp~20#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18585: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~115#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16735: havoc main_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~147#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4580: havoc main_~node4__m4~5#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11187: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~89#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13037: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~86#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3524: havoc main_~node5__m5~6#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8282: havoc main_~check__tmp~65#1;havoc main_~node7__m7~58#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13567: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~114#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10925: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~75#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9604: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~35#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17003: havoc main_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~150#1; [2025-03-08 06:29:20,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20439: havoc main_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~186#1; [2025-03-08 06:29:20,418 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12511: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~103#1; [2025-03-08 06:29:20,418 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14361: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~93#1; [2025-03-08 06:29:20,418 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17797: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~111#1; [2025-03-08 06:29:20,418 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19383: havoc main_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~175#1; [2025-03-08 06:29:20,419 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19912: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~62#1; [2025-03-08 06:29:20,420 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208: havoc main_~node7__m7~8#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16479: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11723: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~95#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474: havoc main_~node5__m5~4#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4853: havoc main_~node6__m6~15#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1682: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6968: havoc main_~node5__m5~13#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14103: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~120#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20975: havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~192#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5120: havoc main_~check__tmp~43#1;havoc main_~node7__m7~30#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8027: havoc main_~node6__m6~29#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: havoc main_~node2__m2~1#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4595: havoc main_~node5__m5~8#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3539: havoc main_~node6__m6~10#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15169: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~97#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9621: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~68#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1958: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3280: havoc main_~node6__m6~9#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19929: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~122#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9095: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~67#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2489: havoc main_~node6__m6~6#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15967: havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~139#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5661: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~45#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16496: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~53#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6983: havoc main_~node6__m6~24#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18347: havoc main_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~164#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13855: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~117#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14912: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-08 06:29:20,421 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9363: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~70#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8042: havoc main_~node7__m7~56#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20727: havoc main_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~189#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12799: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~106#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1172: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10157: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~71#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16235: havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~142#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12272: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~42#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6723: havoc main_~check__tmp~57#1;havoc main_~node7__m7~43#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10687: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~84#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19144: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~60#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc main_~node3__m3~1#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4610: havoc main_~node6__m6~14#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17559: havoc main_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~156#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3554: havoc main_~node7__m7~18#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15711: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6198: havoc main_~check__tmp~52#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11484: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5935: havoc main_~check__tmp~49#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13335: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~112#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2504: havoc main_~node7__m7~10#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4354: havoc main_~node6__m6~13#1; [2025-03-08 06:29:20,422 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1448: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: havoc main_~node5__m5~5#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18099: havoc main_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~161#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16513: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~104#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14929: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4096: havoc main_~node5__m5~7#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node4__m4~1#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4625: havoc main_~node7__m7~26#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10439: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~81#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12289: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~82#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7533: havoc main_~check__tmp~62#1;havoc main_~node7__m7~51#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2248: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19161: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~118#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17311: havoc main_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~153#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8591: havoc main_~node5__m5~17#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3835: havoc main_~node6__m6~11#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13613: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~89#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19691: havoc main_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~178#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17049: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~107#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20485: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~125#1; [2025-03-08 06:29:20,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15728: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~51#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18635: havoc main_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~167#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11501: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~78#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13087: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~109#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1725: havoc main_~node7__m7~5#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4897: havoc main_~check__tmp~42#1;havoc main_~node7__m7~28#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10975: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~87#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14411: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~123#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17847: havoc main_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~159#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9919: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~76#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3050: havoc main_~node6__m6~8#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20227: havoc main_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~184#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2787: havoc main_~node6__m6~7#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14679: havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~126#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4111: havoc main_~node6__m6~12#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14946: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L676: havoc main_~node5__m5~1#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14155: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8606: havoc main_~node6__m6~32#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3850: havoc main_~node7__m7~20#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3324: havoc main_~check__tmp~27#1;havoc main_~node7__m7~16#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8345: havoc main_~node7__m7~59#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15745: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~100#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5704: havoc main_~node7__m7~35#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15219: havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~131#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7027: havoc main_~check__tmp~59#1;havoc main_~node7__m7~46#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9671: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~73#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3065: havoc main_~node7__m7~14#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7822: havoc main_~node5__m5~15#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12051: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~98#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802: havoc main_~node7__m7~12#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19979: havoc main_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~181#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1217: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:20,424 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9409: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~67#1; [2025-03-08 06:29:20,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15487: havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~134#1; [2025-03-08 06:29:20,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12845: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~85#1; [2025-03-08 06:29:20,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18923: havoc main_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~170#1; [2025-03-08 06:29:20,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16281: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~103#1; [2025-03-08 06:29:20,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5183: havoc main_~node7__m7~31#1; [2025-03-08 06:29:20,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4126: havoc main_~node7__m7~22#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18396: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~58#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~node6__m6~1#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16811: havoc main_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~148#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2013: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11263: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~90#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14963: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8621: havoc main_~node7__m7~62#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10207: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~79#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10736: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~38#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14172: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~47#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3602: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17608: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~56#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12587: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~104#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19459: havoc main_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~176#1; [2025-03-08 06:29:20,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4398: havoc main_~check__tmp~38#1;havoc main_~node7__m7~24#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11799: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~96#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~39#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc main_~check__tmp~15#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7837: havoc main_~node6__m6~28#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2552: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13390: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node7__m7~1#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16563: havoc main_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~145#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8107: havoc main_~node7__m7~57#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1765: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18413: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~114#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14980: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~49#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19737: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~121#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1503: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10753: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~74#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12339: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~101#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14189: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~92#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6790: havoc main_~node6__m6~23#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17625: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~110#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19211: havoc main_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~173#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13663: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~115#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9171: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~68#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17099: havoc main_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~151#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20535: havoc main_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~187#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16043: havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~140#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6530: havoc main_~node4__m4~7#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11551: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~93#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6267: havoc main_~check__tmp~53#1;havoc main_~node7__m7~39#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13931: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~118#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3890: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~32#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6004: havoc main_~check__tmp~50#1;havoc main_~node7__m7~37#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9968: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~36#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20803: havoc main_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~190#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14725: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~95#1; [2025-03-08 06:29:20,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7326: havoc main_~node3__m3~5#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13407: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5744: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~46#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20279: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5483: havoc main_~node2__m2~3#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14997: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~96#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L992: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2842: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3373: havoc main_~node7__m7~17#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4166: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~35#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6545: havoc main_~node5__m5~12#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4960: havoc main_~node7__m7~29#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15795: havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~137#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:29:20,428 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7076: havoc main_~node7__m7~47#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12097: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~81#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18175: havoc main_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~162#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15533: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~99#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7341: havoc main_~node4__m4~8#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc main_~node7__m7~7#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18969: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~117#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9985: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~70#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L472: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10515: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~82#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9459: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~71#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11309: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~77#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17387: havoc main_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~154#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4703: havoc main_~check__tmp~40#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12895: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~107#1; [2025-03-08 06:29:20,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16331: havoc main_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~143#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13424: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~45#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16860: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~54#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20296: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~63#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18711: havoc main_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~168#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5498: havoc main_~node3__m3~4#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13163: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~110#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7614: havoc main_~node6__m6~27#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11051: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~88#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L14487: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~124#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17923: havoc main_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~160#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7881: havoc main_~check__tmp~64#1;havoc main_~node7__m7~54#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6560: havoc main_~node6__m6~22#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804: havoc main_~check__tmp~9#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12639: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7356: havoc main_~node5__m5~14#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3657: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19514: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6834: havoc main_~check__tmp~58#1;havoc main_~node7__m7~44#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5513: havoc main_~node4__m4~6#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L13441: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~88#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928: havoc main_~check__tmp~33#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2607: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16877: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~106#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L20313: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~124#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L18463: havoc main_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~165#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11857: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8686: havoc main_~node7__m7~63#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19787: havoc main_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~179#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15295: havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~132#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10803: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~85#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6575: havoc main_~node7__m7~42#1; [2025-03-08 06:29:20,430 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4461: havoc main_~node7__m7~25#1; [2025-03-08 06:29:20,815 INFO L? ?]: Removed 2124 outVars from TransFormulas that were not future-live. [2025-03-08 06:29:20,815 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:29:20,857 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:29:20,858 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:29:20,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:20 BoogieIcfgContainer [2025-03-08 06:29:20,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:29:20,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:29:20,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:29:20,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:29:20,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:29:13" (1/3) ... [2025-03-08 06:29:20,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdf4666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:20, skipping insertion in model container [2025-03-08 06:29:20,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:29:15" (2/3) ... [2025-03-08 06:29:20,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bdf4666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:29:20, skipping insertion in model container [2025-03-08 06:29:20,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:29:20" (3/3) ... [2025-03-08 06:29:20,870 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-03-08 06:29:20,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:29:20,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c that has 1 procedures, 2082 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-08 06:29:20,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:29:20,973 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;@2ea801e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:29:20,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-08 06:29:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 2082 states, 2052 states have (on average 1.8606237816764133) internal successors, (3818), 2081 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:29:21,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:21,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:21,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:21,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -379247245, now seen corresponding path program 1 times [2025-03-08 06:29:21,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:21,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392436713] [2025-03-08 06:29:21,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:21,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:21,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:29:21,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:29:21,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:21,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:21,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392436713] [2025-03-08 06:29:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392436713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:21,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469561252] [2025-03-08 06:29:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:21,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:21,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:21,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:21,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:21,580 INFO L87 Difference]: Start difference. First operand has 2082 states, 2052 states have (on average 1.8606237816764133) internal successors, (3818), 2081 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:22,616 INFO L93 Difference]: Finished difference Result 3095 states and 5492 transitions. [2025-03-08 06:29:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:22,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 06:29:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:22,639 INFO L225 Difference]: With dead ends: 3095 [2025-03-08 06:29:22,641 INFO L226 Difference]: Without dead ends: 1570 [2025-03-08 06:29:22,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:22,650 INFO L435 NwaCegarLoop]: 1861 mSDtfsCounter, 8236 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8236 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:22,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8236 Valid, 1875 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:22,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-08 06:29:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2025-03-08 06:29:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1541 states have (on average 1.3264114211550941) internal successors, (2044), 1569 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2044 transitions. [2025-03-08 06:29:22,736 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2044 transitions. Word has length 101 [2025-03-08 06:29:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:22,737 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2044 transitions. [2025-03-08 06:29:22,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2044 transitions. [2025-03-08 06:29:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:29:22,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:22,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:22,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:29:22,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:22,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:22,742 INFO L85 PathProgramCache]: Analyzing trace with hash 578147581, now seen corresponding path program 1 times [2025-03-08 06:29:22,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:22,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548097638] [2025-03-08 06:29:22,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:22,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:22,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:29:22,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:29:22,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:22,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548097638] [2025-03-08 06:29:22,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548097638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:22,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:22,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:22,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051668580] [2025-03-08 06:29:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:22,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:22,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:22,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:22,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:22,988 INFO L87 Difference]: Start difference. First operand 1570 states and 2044 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:23,706 INFO L93 Difference]: Finished difference Result 2574 states and 3459 transitions. [2025-03-08 06:29:23,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:23,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-08 06:29:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:23,713 INFO L225 Difference]: With dead ends: 2574 [2025-03-08 06:29:23,713 INFO L226 Difference]: Without dead ends: 1326 [2025-03-08 06:29:23,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:23,717 INFO L435 NwaCegarLoop]: 994 mSDtfsCounter, 5198 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5198 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:23,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5198 Valid, 1022 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-08 06:29:23,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2025-03-08 06:29:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1297 states have (on average 1.3623747108712414) internal successors, (1767), 1325 states have internal predecessors, (1767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1767 transitions. [2025-03-08 06:29:23,743 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1767 transitions. Word has length 102 [2025-03-08 06:29:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:23,745 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1767 transitions. [2025-03-08 06:29:23,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1767 transitions. [2025-03-08 06:29:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 06:29:23,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:23,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:23,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:29:23,749 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:23,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:23,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1546199995, now seen corresponding path program 1 times [2025-03-08 06:29:23,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:23,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61534139] [2025-03-08 06:29:23,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:23,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:23,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 06:29:23,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 06:29:23,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:23,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:23,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61534139] [2025-03-08 06:29:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61534139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:23,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000335534] [2025-03-08 06:29:23,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:23,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:23,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:23,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:23,948 INFO L87 Difference]: Start difference. First operand 1326 states and 1767 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:24,562 INFO L93 Difference]: Finished difference Result 2330 states and 3181 transitions. [2025-03-08 06:29:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-08 06:29:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:24,566 INFO L225 Difference]: With dead ends: 2330 [2025-03-08 06:29:24,567 INFO L226 Difference]: Without dead ends: 1195 [2025-03-08 06:29:24,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:24,570 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 4780 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4780 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:24,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4780 Valid, 927 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-03-08 06:29:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1195. [2025-03-08 06:29:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1166 states have (on average 1.3885077186963979) internal successors, (1619), 1194 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1619 transitions. [2025-03-08 06:29:24,586 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1619 transitions. Word has length 103 [2025-03-08 06:29:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:24,587 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1619 transitions. [2025-03-08 06:29:24,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1619 transitions. [2025-03-08 06:29:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 06:29:24,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:24,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:24,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:29:24,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:24,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2137488699, now seen corresponding path program 1 times [2025-03-08 06:29:24,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:24,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560493388] [2025-03-08 06:29:24,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:24,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:29:24,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:29:24,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:24,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560493388] [2025-03-08 06:29:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560493388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690261414] [2025-03-08 06:29:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:24,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:24,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:24,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:24,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:24,744 INFO L87 Difference]: Start difference. First operand 1195 states and 1619 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:25,452 INFO L93 Difference]: Finished difference Result 2199 states and 3032 transitions. [2025-03-08 06:29:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:25,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 06:29:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:25,456 INFO L225 Difference]: With dead ends: 2199 [2025-03-08 06:29:25,456 INFO L226 Difference]: Without dead ends: 1155 [2025-03-08 06:29:25,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:25,457 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 4520 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:25,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 713 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:29:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-03-08 06:29:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2025-03-08 06:29:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1126 states have (on average 1.3943161634103018) internal successors, (1570), 1154 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1570 transitions. [2025-03-08 06:29:25,469 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1570 transitions. Word has length 104 [2025-03-08 06:29:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:25,469 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1570 transitions. [2025-03-08 06:29:25,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1570 transitions. [2025-03-08 06:29:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 06:29:25,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:25,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:25,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:29:25,471 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:25,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1022695171, now seen corresponding path program 1 times [2025-03-08 06:29:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:25,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337233300] [2025-03-08 06:29:25,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:25,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:29:25,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:29:25,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:25,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:25,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337233300] [2025-03-08 06:29:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337233300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:25,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:25,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975119024] [2025-03-08 06:29:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:25,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:25,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:25,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:25,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:25,596 INFO L87 Difference]: Start difference. First operand 1155 states and 1570 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:26,120 INFO L93 Difference]: Finished difference Result 2159 states and 2982 transitions. [2025-03-08 06:29:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:26,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-08 06:29:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:26,123 INFO L225 Difference]: With dead ends: 2159 [2025-03-08 06:29:26,123 INFO L226 Difference]: Without dead ends: 1123 [2025-03-08 06:29:26,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:26,125 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 4450 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:26,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 804 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:29:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-03-08 06:29:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2025-03-08 06:29:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1094 states have (on average 1.4012797074954295) internal successors, (1533), 1122 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1533 transitions. [2025-03-08 06:29:26,136 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1533 transitions. Word has length 105 [2025-03-08 06:29:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:26,136 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1533 transitions. [2025-03-08 06:29:26,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1533 transitions. [2025-03-08 06:29:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 06:29:26,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:26,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:26,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:29:26,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:26,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1380547917, now seen corresponding path program 1 times [2025-03-08 06:29:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591694200] [2025-03-08 06:29:26,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:26,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 06:29:26,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 06:29:26,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:26,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:26,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:26,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591694200] [2025-03-08 06:29:26,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591694200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:26,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:26,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:26,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299654372] [2025-03-08 06:29:26,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:26,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:26,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:26,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:26,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:26,261 INFO L87 Difference]: Start difference. First operand 1123 states and 1533 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:26,734 INFO L93 Difference]: Finished difference Result 2127 states and 2944 transitions. [2025-03-08 06:29:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 06:29:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:26,738 INFO L225 Difference]: With dead ends: 2127 [2025-03-08 06:29:26,738 INFO L226 Difference]: Without dead ends: 1095 [2025-03-08 06:29:26,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:26,739 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 4416 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4416 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:26,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4416 Valid, 849 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:29:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-03-08 06:29:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1095. [2025-03-08 06:29:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 1066 states have (on average 1.4090056285178236) internal successors, (1502), 1094 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1502 transitions. [2025-03-08 06:29:26,751 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1502 transitions. Word has length 106 [2025-03-08 06:29:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:26,751 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1502 transitions. [2025-03-08 06:29:26,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1502 transitions. [2025-03-08 06:29:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 06:29:26,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:26,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:26,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:29:26,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:26,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1179250699, now seen corresponding path program 1 times [2025-03-08 06:29:26,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:26,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127857852] [2025-03-08 06:29:26,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:26,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 06:29:26,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 06:29:26,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:26,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:26,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127857852] [2025-03-08 06:29:26,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127857852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:26,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:26,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:29:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081528564] [2025-03-08 06:29:26,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:29:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:26,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:29:26,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:29:26,875 INFO L87 Difference]: Start difference. First operand 1095 states and 1502 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:27,493 INFO L93 Difference]: Finished difference Result 2099 states and 2912 transitions. [2025-03-08 06:29:27,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:29:27,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-08 06:29:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:27,499 INFO L225 Difference]: With dead ends: 2099 [2025-03-08 06:29:27,499 INFO L226 Difference]: Without dead ends: 1084 [2025-03-08 06:29:27,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:29:27,504 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 4343 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4343 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:27,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4343 Valid, 822 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:29:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2025-03-08 06:29:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2025-03-08 06:29:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4113744075829384) internal successors, (1489), 1083 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1489 transitions. [2025-03-08 06:29:27,516 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1489 transitions. Word has length 107 [2025-03-08 06:29:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:27,516 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1489 transitions. [2025-03-08 06:29:27,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1489 transitions. [2025-03-08 06:29:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:27,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:27,518 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-08 06:29:27,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:29:27,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:27,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2108950507, now seen corresponding path program 1 times [2025-03-08 06:29:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:27,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674207772] [2025-03-08 06:29:27,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:27,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:27,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:27,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:27,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:28,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:28,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674207772] [2025-03-08 06:29:28,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674207772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:28,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:28,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:29:28,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083892356] [2025-03-08 06:29:28,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:28,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:29:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:28,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:29:28,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:29:28,014 INFO L87 Difference]: Start difference. First operand 1084 states and 1489 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-08 06:29:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:29,384 INFO L93 Difference]: Finished difference Result 1996 states and 2648 transitions. [2025-03-08 06:29:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:29:29,384 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-08 06:29:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:29,388 INFO L225 Difference]: With dead ends: 1996 [2025-03-08 06:29:29,389 INFO L226 Difference]: Without dead ends: 1411 [2025-03-08 06:29:29,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:29:29,391 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 5978 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 3100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5978 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:29,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5978 Valid, 2792 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3100 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-03-08 06:29:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1084. [2025-03-08 06:29:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.41042654028436) internal successors, (1488), 1083 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1488 transitions. [2025-03-08 06:29:29,406 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1488 transitions. Word has length 108 [2025-03-08 06:29:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:29,406 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1488 transitions. [2025-03-08 06:29:29,406 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-08 06:29:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1488 transitions. [2025-03-08 06:29:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:29,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:29,408 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-08 06:29:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:29:29,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:29,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash -21583674, now seen corresponding path program 1 times [2025-03-08 06:29:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980946851] [2025-03-08 06:29:29,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:29,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:29,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:29,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:29,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980946851] [2025-03-08 06:29:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980946851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:29,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737548836] [2025-03-08 06:29:29,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:29,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:29,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:29,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:29,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:29,836 INFO L87 Difference]: Start difference. First operand 1084 states and 1488 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:31,525 INFO L93 Difference]: Finished difference Result 1980 states and 2734 transitions. [2025-03-08 06:29:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:31,529 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 06:29:31,529 INFO L226 Difference]: Without dead ends: 1672 [2025-03-08 06:29:31,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:31,530 INFO L435 NwaCegarLoop]: 1205 mSDtfsCounter, 6113 mSDsluCounter, 4865 mSDsCounter, 0 mSdLazyCounter, 4873 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6113 SdHoareTripleChecker+Valid, 6070 SdHoareTripleChecker+Invalid, 4880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:31,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6113 Valid, 6070 Invalid, 4880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4873 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:29:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-03-08 06:29:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1084. [2025-03-08 06:29:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.409478672985782) internal successors, (1487), 1083 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1487 transitions. [2025-03-08 06:29:31,543 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1487 transitions. Word has length 108 [2025-03-08 06:29:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:31,543 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1487 transitions. [2025-03-08 06:29:31,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:31,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1487 transitions. [2025-03-08 06:29:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 06:29:31,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:31,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:31,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:29:31,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:31,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1730853722, now seen corresponding path program 1 times [2025-03-08 06:29:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732073726] [2025-03-08 06:29:31,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:31,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 06:29:31,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 06:29:31,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:31,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:31,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:31,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732073726] [2025-03-08 06:29:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732073726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818769909] [2025-03-08 06:29:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:31,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:31,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:31,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:31,806 INFO L87 Difference]: Start difference. First operand 1084 states and 1487 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:33,091 INFO L93 Difference]: Finished difference Result 1852 states and 2559 transitions. [2025-03-08 06:29:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-08 06:29:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:33,095 INFO L225 Difference]: With dead ends: 1852 [2025-03-08 06:29:33,095 INFO L226 Difference]: Without dead ends: 1668 [2025-03-08 06:29:33,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:33,096 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 5474 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 3513 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 3520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:33,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 4358 Invalid, 3520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3513 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-03-08 06:29:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1084. [2025-03-08 06:29:33,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.408530805687204) internal successors, (1486), 1083 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1486 transitions. [2025-03-08 06:29:33,109 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1486 transitions. Word has length 108 [2025-03-08 06:29:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:33,109 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1486 transitions. [2025-03-08 06:29:33,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1486 transitions. [2025-03-08 06:29:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:33,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:33,111 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-08 06:29:33,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:29:33,112 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash 596736680, now seen corresponding path program 1 times [2025-03-08 06:29:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871102847] [2025-03-08 06:29:33,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:33,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:33,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:33,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:33,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:33,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:33,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:33,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871102847] [2025-03-08 06:29:33,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871102847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:33,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:33,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:33,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034696928] [2025-03-08 06:29:33,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:33,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:33,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:33,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:33,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:33,458 INFO L87 Difference]: Start difference. First operand 1084 states and 1486 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:34,898 INFO L93 Difference]: Finished difference Result 1789 states and 2461 transitions. [2025-03-08 06:29:34,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:34,902 INFO L225 Difference]: With dead ends: 1789 [2025-03-08 06:29:34,902 INFO L226 Difference]: Without dead ends: 1660 [2025-03-08 06:29:34,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:34,903 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 5163 mSDsluCounter, 3472 mSDsCounter, 0 mSdLazyCounter, 3563 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5163 SdHoareTripleChecker+Valid, 4369 SdHoareTripleChecker+Invalid, 3569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:34,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5163 Valid, 4369 Invalid, 3569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3563 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-08 06:29:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1084. [2025-03-08 06:29:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4075829383886256) internal successors, (1485), 1083 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1485 transitions. [2025-03-08 06:29:34,914 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1485 transitions. Word has length 110 [2025-03-08 06:29:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:34,915 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1485 transitions. [2025-03-08 06:29:34,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1485 transitions. [2025-03-08 06:29:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:34,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:34,916 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-08 06:29:34,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:29:34,917 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-08 06:29:34,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:34,917 INFO L85 PathProgramCache]: Analyzing trace with hash 10914790, now seen corresponding path program 1 times [2025-03-08 06:29:34,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:34,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863807372] [2025-03-08 06:29:34,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:34,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:34,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:34,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:34,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:35,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:35,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863807372] [2025-03-08 06:29:35,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863807372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:35,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:35,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:35,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077014505] [2025-03-08 06:29:35,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:35,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:35,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:35,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:35,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:35,174 INFO L87 Difference]: Start difference. First operand 1084 states and 1485 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:36,382 INFO L93 Difference]: Finished difference Result 1796 states and 2466 transitions. [2025-03-08 06:29:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:36,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:36,386 INFO L225 Difference]: With dead ends: 1796 [2025-03-08 06:29:36,386 INFO L226 Difference]: Without dead ends: 1660 [2025-03-08 06:29:36,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:36,387 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 3681 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 3225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3681 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:36,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3681 Valid, 3907 Invalid, 3231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3225 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-08 06:29:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1084. [2025-03-08 06:29:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4066350710900475) internal successors, (1484), 1083 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1484 transitions. [2025-03-08 06:29:36,398 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1484 transitions. Word has length 110 [2025-03-08 06:29:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:36,398 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1484 transitions. [2025-03-08 06:29:36,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1484 transitions. [2025-03-08 06:29:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:36,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:36,400 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-08 06:29:36,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:29:36,400 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:36,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:36,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1787629222, now seen corresponding path program 1 times [2025-03-08 06:29:36,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:36,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383816460] [2025-03-08 06:29:36,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:36,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:36,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:36,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:36,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383816460] [2025-03-08 06:29:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383816460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394567694] [2025-03-08 06:29:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:36,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:36,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:36,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:36,618 INFO L87 Difference]: Start difference. First operand 1084 states and 1484 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:38,009 INFO L93 Difference]: Finished difference Result 1873 states and 2577 transitions. [2025-03-08 06:29:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:38,013 INFO L225 Difference]: With dead ends: 1873 [2025-03-08 06:29:38,013 INFO L226 Difference]: Without dead ends: 1668 [2025-03-08 06:29:38,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:38,014 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 7094 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7094 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 3703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:38,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7094 Valid, 4529 Invalid, 3703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-03-08 06:29:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1084. [2025-03-08 06:29:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4056872037914692) internal successors, (1483), 1083 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1483 transitions. [2025-03-08 06:29:38,025 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1483 transitions. Word has length 110 [2025-03-08 06:29:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:38,025 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1483 transitions. [2025-03-08 06:29:38,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1483 transitions. [2025-03-08 06:29:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:38,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:38,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, 1, 1] [2025-03-08 06:29:38,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:29:38,027 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:38,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -307529724, now seen corresponding path program 1 times [2025-03-08 06:29:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:38,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453771448] [2025-03-08 06:29:38,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:38,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:38,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:38,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453771448] [2025-03-08 06:29:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453771448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949291267] [2025-03-08 06:29:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:38,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:38,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:38,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:38,295 INFO L87 Difference]: Start difference. First operand 1084 states and 1483 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:39,591 INFO L93 Difference]: Finished difference Result 1796 states and 2464 transitions. [2025-03-08 06:29:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:39,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:39,594 INFO L225 Difference]: With dead ends: 1796 [2025-03-08 06:29:39,594 INFO L226 Difference]: Without dead ends: 1660 [2025-03-08 06:29:39,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:39,595 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 7412 mSDsluCounter, 3302 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7412 SdHoareTripleChecker+Valid, 4290 SdHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:39,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7412 Valid, 4290 Invalid, 3496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-08 06:29:39,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1084. [2025-03-08 06:29:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.404739336492891) internal successors, (1482), 1083 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1482 transitions. [2025-03-08 06:29:39,604 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1482 transitions. Word has length 110 [2025-03-08 06:29:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:39,604 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1482 transitions. [2025-03-08 06:29:39,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1482 transitions. [2025-03-08 06:29:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:39,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:39,606 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-08 06:29:39,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:29:39,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:39,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:39,606 INFO L85 PathProgramCache]: Analyzing trace with hash 436458389, now seen corresponding path program 1 times [2025-03-08 06:29:39,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:39,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318298262] [2025-03-08 06:29:39,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:39,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:39,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:39,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:39,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:39,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:40,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:40,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318298262] [2025-03-08 06:29:40,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318298262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:40,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:40,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 06:29:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236195724] [2025-03-08 06:29:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:40,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:29:40,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:40,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:29:40,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:29:40,136 INFO L87 Difference]: Start difference. First operand 1084 states and 1482 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-08 06:29:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:42,195 INFO L93 Difference]: Finished difference Result 2148 states and 2946 transitions. [2025-03-08 06:29:42,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:29:42,195 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-08 06:29:42,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:42,199 INFO L225 Difference]: With dead ends: 2148 [2025-03-08 06:29:42,199 INFO L226 Difference]: Without dead ends: 1790 [2025-03-08 06:29:42,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:29:42,204 INFO L435 NwaCegarLoop]: 1244 mSDtfsCounter, 6609 mSDsluCounter, 6452 mSDsCounter, 0 mSdLazyCounter, 6220 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6609 SdHoareTripleChecker+Valid, 7696 SdHoareTripleChecker+Invalid, 6232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 6220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:42,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6609 Valid, 7696 Invalid, 6232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 6220 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 06:29:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2025-03-08 06:29:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1084. [2025-03-08 06:29:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4037914691943127) internal successors, (1481), 1083 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1481 transitions. [2025-03-08 06:29:42,215 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1481 transitions. Word has length 110 [2025-03-08 06:29:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:42,215 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1481 transitions. [2025-03-08 06:29:42,215 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-08 06:29:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1481 transitions. [2025-03-08 06:29:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:42,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:42,217 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-08 06:29:42,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:29:42,217 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:42,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:42,218 INFO L85 PathProgramCache]: Analyzing trace with hash 348872772, now seen corresponding path program 1 times [2025-03-08 06:29:42,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:42,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254841874] [2025-03-08 06:29:42,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:42,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:42,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:42,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:42,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:42,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254841874] [2025-03-08 06:29:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254841874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778285041] [2025-03-08 06:29:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:42,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:42,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:42,489 INFO L87 Difference]: Start difference. First operand 1084 states and 1481 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:44,065 INFO L93 Difference]: Finished difference Result 1873 states and 2568 transitions. [2025-03-08 06:29:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:44,069 INFO L225 Difference]: With dead ends: 1873 [2025-03-08 06:29:44,069 INFO L226 Difference]: Without dead ends: 1668 [2025-03-08 06:29:44,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:44,070 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 6082 mSDsluCounter, 4907 mSDsCounter, 0 mSdLazyCounter, 4766 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6082 SdHoareTripleChecker+Valid, 6117 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:44,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6082 Valid, 6117 Invalid, 4773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4766 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:29:44,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-03-08 06:29:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1084. [2025-03-08 06:29:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4028436018957346) internal successors, (1480), 1083 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1480 transitions. [2025-03-08 06:29:44,079 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1480 transitions. Word has length 110 [2025-03-08 06:29:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:44,079 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1480 transitions. [2025-03-08 06:29:44,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1480 transitions. [2025-03-08 06:29:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 06:29:44,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:44,081 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-08 06:29:44,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:29:44,081 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:44,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1746286174, now seen corresponding path program 1 times [2025-03-08 06:29:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:44,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431922370] [2025-03-08 06:29:44,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:44,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:44,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 06:29:44,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 06:29:44,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:44,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:44,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431922370] [2025-03-08 06:29:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431922370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305503550] [2025-03-08 06:29:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:44,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:44,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:44,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:44,426 INFO L87 Difference]: Start difference. First operand 1084 states and 1480 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:45,838 INFO L93 Difference]: Finished difference Result 1796 states and 2460 transitions. [2025-03-08 06:29:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:45,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-08 06:29:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:45,841 INFO L225 Difference]: With dead ends: 1796 [2025-03-08 06:29:45,841 INFO L226 Difference]: Without dead ends: 1660 [2025-03-08 06:29:45,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:45,842 INFO L435 NwaCegarLoop]: 1073 mSDtfsCounter, 6920 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 3774 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6920 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 3781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:45,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6920 Valid, 4630 Invalid, 3781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3774 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-08 06:29:45,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1084. [2025-03-08 06:29:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4018957345971563) internal successors, (1479), 1083 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:45,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1479 transitions. [2025-03-08 06:29:45,851 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1479 transitions. Word has length 110 [2025-03-08 06:29:45,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:45,852 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1479 transitions. [2025-03-08 06:29:45,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:45,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1479 transitions. [2025-03-08 06:29:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:45,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:45,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:45,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:29:45,854 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:45,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:45,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1758211035, now seen corresponding path program 1 times [2025-03-08 06:29:45,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:45,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872083046] [2025-03-08 06:29:45,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:45,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:45,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:45,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:45,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:46,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:46,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872083046] [2025-03-08 06:29:46,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872083046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:46,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:46,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638413232] [2025-03-08 06:29:46,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:46,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:46,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:46,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:46,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:46,118 INFO L87 Difference]: Start difference. First operand 1084 states and 1479 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:47,546 INFO L93 Difference]: Finished difference Result 1748 states and 2389 transitions. [2025-03-08 06:29:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:47,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:47,551 INFO L225 Difference]: With dead ends: 1748 [2025-03-08 06:29:47,551 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 06:29:47,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:47,551 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 6380 mSDsluCounter, 4212 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6380 SdHoareTripleChecker+Valid, 5226 SdHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:47,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6380 Valid, 5226 Invalid, 4280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 06:29:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1084. [2025-03-08 06:29:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4009478672985782) internal successors, (1478), 1083 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:47,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1478 transitions. [2025-03-08 06:29:47,562 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1478 transitions. Word has length 112 [2025-03-08 06:29:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:47,563 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1478 transitions. [2025-03-08 06:29:47,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1478 transitions. [2025-03-08 06:29:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:47,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:47,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:47,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:29:47,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:47,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1844862680, now seen corresponding path program 1 times [2025-03-08 06:29:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:47,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906683877] [2025-03-08 06:29:47,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:47,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:47,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:47,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:47,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:47,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:47,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:47,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906683877] [2025-03-08 06:29:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906683877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:47,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:47,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925671132] [2025-03-08 06:29:47,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:47,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:47,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:47,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:47,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:47,786 INFO L87 Difference]: Start difference. First operand 1084 states and 1478 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:48,955 INFO L93 Difference]: Finished difference Result 1750 states and 2390 transitions. [2025-03-08 06:29:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:48,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:48,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:48,958 INFO L225 Difference]: With dead ends: 1750 [2025-03-08 06:29:48,958 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 06:29:48,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:48,958 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 3553 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3553 SdHoareTripleChecker+Valid, 4132 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:48,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3553 Valid, 4132 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3435 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:48,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 06:29:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1084. [2025-03-08 06:29:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.4) internal successors, (1477), 1083 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1477 transitions. [2025-03-08 06:29:48,967 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1477 transitions. Word has length 112 [2025-03-08 06:29:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:48,967 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1477 transitions. [2025-03-08 06:29:48,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1477 transitions. [2025-03-08 06:29:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:48,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:48,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:48,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:29:48,969 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:48,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash -200946170, now seen corresponding path program 1 times [2025-03-08 06:29:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:48,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409922333] [2025-03-08 06:29:48,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:48,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:49,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:49,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:49,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:49,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409922333] [2025-03-08 06:29:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409922333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:49,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:49,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563795399] [2025-03-08 06:29:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:49,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:49,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:49,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:49,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:49,168 INFO L87 Difference]: Start difference. First operand 1084 states and 1477 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:50,222 INFO L93 Difference]: Finished difference Result 1561 states and 2080 transitions. [2025-03-08 06:29:50,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:50,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:50,225 INFO L225 Difference]: With dead ends: 1561 [2025-03-08 06:29:50,225 INFO L226 Difference]: Without dead ends: 1556 [2025-03-08 06:29:50,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:50,225 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 8051 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 2828 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8051 SdHoareTripleChecker+Valid, 3173 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:50,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8051 Valid, 3173 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:29:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-08 06:29:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1084. [2025-03-08 06:29:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3990521327014218) internal successors, (1476), 1083 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1476 transitions. [2025-03-08 06:29:50,234 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1476 transitions. Word has length 112 [2025-03-08 06:29:50,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:50,235 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1476 transitions. [2025-03-08 06:29:50,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1476 transitions. [2025-03-08 06:29:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:50,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:50,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:50,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:29:50,236 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:50,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash 580154274, now seen corresponding path program 1 times [2025-03-08 06:29:50,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:50,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403447933] [2025-03-08 06:29:50,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:50,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:50,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:50,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:50,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:50,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403447933] [2025-03-08 06:29:50,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403447933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:50,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:50,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:50,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716528670] [2025-03-08 06:29:50,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:50,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:50,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:50,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:50,459 INFO L87 Difference]: Start difference. First operand 1084 states and 1476 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:51,828 INFO L93 Difference]: Finished difference Result 1750 states and 2386 transitions. [2025-03-08 06:29:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:51,831 INFO L225 Difference]: With dead ends: 1750 [2025-03-08 06:29:51,831 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 06:29:51,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:51,832 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 6371 mSDsluCounter, 4200 mSDsCounter, 0 mSdLazyCounter, 4248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6371 SdHoareTripleChecker+Valid, 5210 SdHoareTripleChecker+Invalid, 4254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:51,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6371 Valid, 5210 Invalid, 4254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4248 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 06:29:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1084. [2025-03-08 06:29:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3981042654028435) internal successors, (1475), 1083 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1475 transitions. [2025-03-08 06:29:51,841 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1475 transitions. Word has length 112 [2025-03-08 06:29:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:51,841 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1475 transitions. [2025-03-08 06:29:51,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1475 transitions. [2025-03-08 06:29:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:51,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:51,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:51,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:29:51,842 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1283454716, now seen corresponding path program 1 times [2025-03-08 06:29:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824924051] [2025-03-08 06:29:51,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:51,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:51,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:51,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824924051] [2025-03-08 06:29:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824924051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:52,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:52,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312298540] [2025-03-08 06:29:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:52,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:52,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:52,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:52,036 INFO L87 Difference]: Start difference. First operand 1084 states and 1475 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:53,213 INFO L93 Difference]: Finished difference Result 1755 states and 2390 transitions. [2025-03-08 06:29:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:53,215 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:53,218 INFO L225 Difference]: With dead ends: 1755 [2025-03-08 06:29:53,218 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 06:29:53,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:53,219 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 7356 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 3413 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7356 SdHoareTripleChecker+Valid, 4132 SdHoareTripleChecker+Invalid, 3420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:53,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7356 Valid, 4132 Invalid, 3420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3413 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:29:53,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 06:29:53,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1084. [2025-03-08 06:29:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3971563981042654) internal successors, (1474), 1083 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1474 transitions. [2025-03-08 06:29:53,228 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1474 transitions. Word has length 112 [2025-03-08 06:29:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:53,228 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1474 transitions. [2025-03-08 06:29:53,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:53,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1474 transitions. [2025-03-08 06:29:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:53,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:53,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:53,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:29:53,230 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:53,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash -502087155, now seen corresponding path program 1 times [2025-03-08 06:29:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784777067] [2025-03-08 06:29:53,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:53,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:53,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:53,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:53,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:53,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784777067] [2025-03-08 06:29:53,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784777067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:53,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:53,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:53,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850360250] [2025-03-08 06:29:53,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:53,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:53,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:53,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:53,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:53,416 INFO L87 Difference]: Start difference. First operand 1084 states and 1474 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:54,574 INFO L93 Difference]: Finished difference Result 1750 states and 2383 transitions. [2025-03-08 06:29:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:54,577 INFO L225 Difference]: With dead ends: 1750 [2025-03-08 06:29:54,577 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 06:29:54,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:54,577 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 3545 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 3397 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3545 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:54,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3545 Valid, 4147 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3397 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:29:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 06:29:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1084. [2025-03-08 06:29:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3962085308056873) internal successors, (1473), 1083 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1473 transitions. [2025-03-08 06:29:54,587 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1473 transitions. Word has length 112 [2025-03-08 06:29:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:54,588 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1473 transitions. [2025-03-08 06:29:54,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1473 transitions. [2025-03-08 06:29:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:54,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:54,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:54,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:29:54,589 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:54,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1696504442, now seen corresponding path program 1 times [2025-03-08 06:29:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:54,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933920446] [2025-03-08 06:29:54,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:54,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:54,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:54,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:54,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933920446] [2025-03-08 06:29:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933920446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:54,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100493889] [2025-03-08 06:29:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:54,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:54,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:54,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:54,792 INFO L87 Difference]: Start difference. First operand 1084 states and 1473 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:56,209 INFO L93 Difference]: Finished difference Result 1810 states and 2465 transitions. [2025-03-08 06:29:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:29:56,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:56,212 INFO L225 Difference]: With dead ends: 1810 [2025-03-08 06:29:56,212 INFO L226 Difference]: Without dead ends: 1660 [2025-03-08 06:29:56,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:29:56,213 INFO L435 NwaCegarLoop]: 1122 mSDtfsCounter, 4701 mSDsluCounter, 4580 mSDsCounter, 0 mSdLazyCounter, 4601 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4701 SdHoareTripleChecker+Valid, 5702 SdHoareTripleChecker+Invalid, 4606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:56,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4701 Valid, 5702 Invalid, 4606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4601 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:29:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-08 06:29:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1084. [2025-03-08 06:29:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.395260663507109) internal successors, (1472), 1083 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1472 transitions. [2025-03-08 06:29:56,224 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1472 transitions. Word has length 112 [2025-03-08 06:29:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:56,224 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1472 transitions. [2025-03-08 06:29:56,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1472 transitions. [2025-03-08 06:29:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:56,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:56,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:56,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:29:56,225 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:56,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:56,225 INFO L85 PathProgramCache]: Analyzing trace with hash -437290923, now seen corresponding path program 1 times [2025-03-08 06:29:56,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:56,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808690871] [2025-03-08 06:29:56,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:56,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:56,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:56,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:56,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:56,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808690871] [2025-03-08 06:29:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808690871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:29:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715604778] [2025-03-08 06:29:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:56,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:29:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:56,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:29:56,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:29:56,435 INFO L87 Difference]: Start difference. First operand 1084 states and 1472 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:57,798 INFO L93 Difference]: Finished difference Result 1755 states and 2386 transitions. [2025-03-08 06:29:57,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:29:57,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:57,800 INFO L225 Difference]: With dead ends: 1755 [2025-03-08 06:29:57,800 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 06:29:57,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:29:57,801 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 6362 mSDsluCounter, 4196 mSDsCounter, 0 mSdLazyCounter, 4190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6362 SdHoareTripleChecker+Valid, 5204 SdHoareTripleChecker+Invalid, 4197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:57,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6362 Valid, 5204 Invalid, 4197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4190 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:29:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 06:29:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1084. [2025-03-08 06:29:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3943127962085309) internal successors, (1471), 1083 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1471 transitions. [2025-03-08 06:29:57,809 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1471 transitions. Word has length 112 [2025-03-08 06:29:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:57,809 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1471 transitions. [2025-03-08 06:29:57,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1471 transitions. [2025-03-08 06:29:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:57,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:57,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:29:57,811 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:57,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1362002684, now seen corresponding path program 1 times [2025-03-08 06:29:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051125677] [2025-03-08 06:29:57,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:57,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:57,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:57,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:57,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:29:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:29:58,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:29:58,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051125677] [2025-03-08 06:29:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051125677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:29:58,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:29:58,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:29:58,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505336530] [2025-03-08 06:29:58,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:29:58,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:29:58,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:29:58,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:29:58,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:29:58,135 INFO L87 Difference]: Start difference. First operand 1084 states and 1471 transitions. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:29:59,852 INFO L93 Difference]: Finished difference Result 2144 states and 2944 transitions. [2025-03-08 06:29:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:29:59,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:29:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:29:59,855 INFO L225 Difference]: With dead ends: 2144 [2025-03-08 06:29:59,855 INFO L226 Difference]: Without dead ends: 1994 [2025-03-08 06:29:59,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:29:59,856 INFO L435 NwaCegarLoop]: 1049 mSDtfsCounter, 9886 mSDsluCounter, 3892 mSDsCounter, 0 mSdLazyCounter, 3999 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9886 SdHoareTripleChecker+Valid, 4941 SdHoareTripleChecker+Invalid, 4339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 3999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:29:59,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9886 Valid, 4941 Invalid, 4339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 3999 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 06:29:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2025-03-08 06:29:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1088. [2025-03-08 06:29:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.392823418319169) internal successors, (1475), 1087 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1475 transitions. [2025-03-08 06:29:59,866 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1475 transitions. Word has length 112 [2025-03-08 06:29:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:29:59,866 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1475 transitions. [2025-03-08 06:29:59,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:29:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1475 transitions. [2025-03-08 06:29:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:29:59,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:29:59,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:29:59,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:29:59,867 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:29:59,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:29:59,868 INFO L85 PathProgramCache]: Analyzing trace with hash -102789165, now seen corresponding path program 1 times [2025-03-08 06:29:59,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:29:59,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215983678] [2025-03-08 06:29:59,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:29:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:29:59,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:29:59,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:29:59,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:29:59,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215983678] [2025-03-08 06:30:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215983678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:00,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:00,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:00,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474704268] [2025-03-08 06:30:00,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:00,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:00,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:00,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:00,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:00,078 INFO L87 Difference]: Start difference. First operand 1088 states and 1475 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:01,512 INFO L93 Difference]: Finished difference Result 1759 states and 2388 transitions. [2025-03-08 06:30:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:30:01,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:01,515 INFO L225 Difference]: With dead ends: 1759 [2025-03-08 06:30:01,515 INFO L226 Difference]: Without dead ends: 1648 [2025-03-08 06:30:01,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:01,516 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 6358 mSDsluCounter, 4196 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6358 SdHoareTripleChecker+Valid, 5204 SdHoareTripleChecker+Invalid, 4193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:01,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6358 Valid, 5204 Invalid, 4193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 06:30:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-08 06:30:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1088. [2025-03-08 06:30:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.3918791312559018) internal successors, (1474), 1087 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1474 transitions. [2025-03-08 06:30:01,523 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1474 transitions. Word has length 112 [2025-03-08 06:30:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1474 transitions. [2025-03-08 06:30:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1474 transitions. [2025-03-08 06:30:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:30:01,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:01,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:01,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:30:01,525 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:01,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash -166992576, now seen corresponding path program 1 times [2025-03-08 06:30:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70483996] [2025-03-08 06:30:01,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:01,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:30:01,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:30:01,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:01,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:01,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:01,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70483996] [2025-03-08 06:30:01,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70483996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:01,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:01,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:01,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769833878] [2025-03-08 06:30:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:01,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:01,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:01,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:01,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:01,708 INFO L87 Difference]: Start difference. First operand 1088 states and 1474 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:02,747 INFO L93 Difference]: Finished difference Result 1648 states and 2200 transitions. [2025-03-08 06:30:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:02,747 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:30:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:02,750 INFO L225 Difference]: With dead ends: 1648 [2025-03-08 06:30:02,750 INFO L226 Difference]: Without dead ends: 1560 [2025-03-08 06:30:02,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:02,751 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 6010 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6010 SdHoareTripleChecker+Valid, 3173 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:02,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6010 Valid, 3173 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:30:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-03-08 06:30:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1088. [2025-03-08 06:30:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.3909348441926346) internal successors, (1473), 1087 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1473 transitions. [2025-03-08 06:30:02,760 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1473 transitions. Word has length 112 [2025-03-08 06:30:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:02,760 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1473 transitions. [2025-03-08 06:30:02,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1473 transitions. [2025-03-08 06:30:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:30:02,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:02,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:02,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:30:02,762 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:02,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:02,763 INFO L85 PathProgramCache]: Analyzing trace with hash -948952958, now seen corresponding path program 1 times [2025-03-08 06:30:02,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:02,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522416220] [2025-03-08 06:30:02,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:02,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:02,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:30:02,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:30:02,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:02,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:02,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:02,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522416220] [2025-03-08 06:30:02,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522416220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:02,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:02,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013051535] [2025-03-08 06:30:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:02,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:02,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:02,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:02,950 INFO L87 Difference]: Start difference. First operand 1088 states and 1473 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:04,129 INFO L93 Difference]: Finished difference Result 1759 states and 2386 transitions. [2025-03-08 06:30:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:30:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:04,132 INFO L225 Difference]: With dead ends: 1759 [2025-03-08 06:30:04,133 INFO L226 Difference]: Without dead ends: 1648 [2025-03-08 06:30:04,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:04,133 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 5287 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 3524 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 4328 SdHoareTripleChecker+Invalid, 3531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:04,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 4328 Invalid, 3531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3524 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-08 06:30:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1088. [2025-03-08 06:30:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.3899905571293674) internal successors, (1472), 1087 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1472 transitions. [2025-03-08 06:30:04,143 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1472 transitions. Word has length 112 [2025-03-08 06:30:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:04,143 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1472 transitions. [2025-03-08 06:30:04,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1472 transitions. [2025-03-08 06:30:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:30:04,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:04,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:04,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:30:04,145 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:04,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash 347259157, now seen corresponding path program 1 times [2025-03-08 06:30:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117245232] [2025-03-08 06:30:04,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:04,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:30:04,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:30:04,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:04,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:04,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:04,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117245232] [2025-03-08 06:30:04,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117245232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:04,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:04,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:30:04,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671366602] [2025-03-08 06:30:04,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:04,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:30:04,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:04,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:30:04,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:30:04,472 INFO L87 Difference]: Start difference. First operand 1088 states and 1472 transitions. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:06,370 INFO L93 Difference]: Finished difference Result 2280 states and 3131 transitions. [2025-03-08 06:30:06,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:30:06,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:30:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:06,374 INFO L225 Difference]: With dead ends: 2280 [2025-03-08 06:30:06,374 INFO L226 Difference]: Without dead ends: 2046 [2025-03-08 06:30:06,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:30:06,375 INFO L435 NwaCegarLoop]: 1204 mSDtfsCounter, 10695 mSDsluCounter, 4456 mSDsCounter, 0 mSdLazyCounter, 4535 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10695 SdHoareTripleChecker+Valid, 5660 SdHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 4535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:06,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10695 Valid, 5660 Invalid, 4852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 4535 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:30:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2025-03-08 06:30:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1092. [2025-03-08 06:30:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1063 states have (on average 1.3885230479774224) internal successors, (1476), 1091 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1476 transitions. [2025-03-08 06:30:06,386 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1476 transitions. Word has length 112 [2025-03-08 06:30:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:06,386 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1476 transitions. [2025-03-08 06:30:06,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 11 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1476 transitions. [2025-03-08 06:30:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:30:06,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:06,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:06,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:30:06,388 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:06,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1458913982, now seen corresponding path program 1 times [2025-03-08 06:30:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706849475] [2025-03-08 06:30:06,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:06,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:30:06,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:30:06,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:06,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:06,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:06,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706849475] [2025-03-08 06:30:06,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706849475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:06,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:06,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:06,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929455469] [2025-03-08 06:30:06,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:06,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:06,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:06,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:06,600 INFO L87 Difference]: Start difference. First operand 1092 states and 1476 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:07,800 INFO L93 Difference]: Finished difference Result 1814 states and 2460 transitions. [2025-03-08 06:30:07,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:07,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:30:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:07,803 INFO L225 Difference]: With dead ends: 1814 [2025-03-08 06:30:07,803 INFO L226 Difference]: Without dead ends: 1664 [2025-03-08 06:30:07,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:07,803 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 5250 mSDsluCounter, 3422 mSDsCounter, 0 mSdLazyCounter, 3552 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5250 SdHoareTripleChecker+Valid, 4450 SdHoareTripleChecker+Invalid, 3559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:07,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5250 Valid, 4450 Invalid, 3559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2025-03-08 06:30:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1092. [2025-03-08 06:30:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1063 states have (on average 1.38758231420508) internal successors, (1475), 1091 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:07,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1475 transitions. [2025-03-08 06:30:07,812 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1475 transitions. Word has length 112 [2025-03-08 06:30:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1475 transitions. [2025-03-08 06:30:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1475 transitions. [2025-03-08 06:30:07,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 06:30:07,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:07,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:07,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:30:07,814 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:07,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1576839795, now seen corresponding path program 1 times [2025-03-08 06:30:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:07,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789420968] [2025-03-08 06:30:07,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:07,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 06:30:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 06:30:07,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:07,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:08,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:08,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789420968] [2025-03-08 06:30:08,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789420968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:08,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:08,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:08,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101768914] [2025-03-08 06:30:08,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:08,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:08,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:08,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:08,007 INFO L87 Difference]: Start difference. First operand 1092 states and 1475 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:09,232 INFO L93 Difference]: Finished difference Result 1763 states and 2388 transitions. [2025-03-08 06:30:09,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:09,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 06:30:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:09,234 INFO L225 Difference]: With dead ends: 1763 [2025-03-08 06:30:09,234 INFO L226 Difference]: Without dead ends: 1652 [2025-03-08 06:30:09,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:09,235 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 5111 mSDsluCounter, 3482 mSDsCounter, 0 mSdLazyCounter, 3644 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5111 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 3651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:09,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5111 Valid, 4539 Invalid, 3651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3644 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-03-08 06:30:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1092. [2025-03-08 06:30:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1063 states have (on average 1.3866415804327374) internal successors, (1474), 1091 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1474 transitions. [2025-03-08 06:30:09,245 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1474 transitions. Word has length 112 [2025-03-08 06:30:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:09,245 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1474 transitions. [2025-03-08 06:30:09,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1474 transitions. [2025-03-08 06:30:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:09,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:09,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:09,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:30:09,247 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:09,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1187738377, now seen corresponding path program 1 times [2025-03-08 06:30:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:09,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491039731] [2025-03-08 06:30:09,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:09,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:09,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:09,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:09,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491039731] [2025-03-08 06:30:09,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491039731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:09,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:09,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250544518] [2025-03-08 06:30:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:09,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:09,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:09,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:09,426 INFO L87 Difference]: Start difference. First operand 1092 states and 1474 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:10,693 INFO L93 Difference]: Finished difference Result 1814 states and 2455 transitions. [2025-03-08 06:30:10,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:10,695 INFO L225 Difference]: With dead ends: 1814 [2025-03-08 06:30:10,695 INFO L226 Difference]: Without dead ends: 1664 [2025-03-08 06:30:10,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:30:10,696 INFO L435 NwaCegarLoop]: 1070 mSDtfsCounter, 5093 mSDsluCounter, 3545 mSDsCounter, 0 mSdLazyCounter, 3700 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5093 SdHoareTripleChecker+Valid, 4615 SdHoareTripleChecker+Invalid, 3706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:10,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5093 Valid, 4615 Invalid, 3706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3700 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2025-03-08 06:30:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1088. [2025-03-08 06:30:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.3871576959395657) internal successors, (1469), 1087 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1469 transitions. [2025-03-08 06:30:10,705 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1469 transitions. Word has length 113 [2025-03-08 06:30:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:10,705 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1469 transitions. [2025-03-08 06:30:10,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1469 transitions. [2025-03-08 06:30:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:10,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:10,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:10,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:30:10,706 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:10,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1914926496, now seen corresponding path program 1 times [2025-03-08 06:30:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997363233] [2025-03-08 06:30:10,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:10,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:10,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:10,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:10,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:10,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:10,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997363233] [2025-03-08 06:30:10,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997363233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:10,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:10,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:10,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204661534] [2025-03-08 06:30:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:10,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:10,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:10,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:10,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:10,912 INFO L87 Difference]: Start difference. First operand 1088 states and 1469 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:12,150 INFO L93 Difference]: Finished difference Result 1774 states and 2395 transitions. [2025-03-08 06:30:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:12,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:12,153 INFO L225 Difference]: With dead ends: 1774 [2025-03-08 06:30:12,153 INFO L226 Difference]: Without dead ends: 1648 [2025-03-08 06:30:12,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:12,154 INFO L435 NwaCegarLoop]: 1102 mSDtfsCounter, 3272 mSDsluCounter, 3614 mSDsCounter, 0 mSdLazyCounter, 3782 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3272 SdHoareTripleChecker+Valid, 4716 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:12,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3272 Valid, 4716 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3782 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-08 06:30:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1088. [2025-03-08 06:30:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.3862134088762983) internal successors, (1468), 1087 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1468 transitions. [2025-03-08 06:30:12,164 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1468 transitions. Word has length 113 [2025-03-08 06:30:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:12,164 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1468 transitions. [2025-03-08 06:30:12,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1468 transitions. [2025-03-08 06:30:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:12,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:12,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:12,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:30:12,166 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:12,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1749858398, now seen corresponding path program 1 times [2025-03-08 06:30:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:12,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332812967] [2025-03-08 06:30:12,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:12,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:12,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:12,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:12,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:12,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332812967] [2025-03-08 06:30:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332812967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:12,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:12,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750242890] [2025-03-08 06:30:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:12,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:12,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:12,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:12,360 INFO L87 Difference]: Start difference. First operand 1088 states and 1468 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:13,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:13,555 INFO L93 Difference]: Finished difference Result 1829 states and 2467 transitions. [2025-03-08 06:30:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:13,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:13,557 INFO L225 Difference]: With dead ends: 1829 [2025-03-08 06:30:13,557 INFO L226 Difference]: Without dead ends: 1664 [2025-03-08 06:30:13,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:13,558 INFO L435 NwaCegarLoop]: 1073 mSDtfsCounter, 5073 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5073 SdHoareTripleChecker+Valid, 4627 SdHoareTripleChecker+Invalid, 3688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:13,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5073 Valid, 4627 Invalid, 3688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3681 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2025-03-08 06:30:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1088. [2025-03-08 06:30:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.385269121813031) internal successors, (1467), 1087 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1467 transitions. [2025-03-08 06:30:13,567 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1467 transitions. Word has length 113 [2025-03-08 06:30:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:13,567 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1467 transitions. [2025-03-08 06:30:13,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1467 transitions. [2025-03-08 06:30:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:13,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:13,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:13,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:30:13,568 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:13,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1495032679, now seen corresponding path program 1 times [2025-03-08 06:30:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:13,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364731672] [2025-03-08 06:30:13,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:13,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:13,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:13,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:13,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:13,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:13,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:13,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364731672] [2025-03-08 06:30:13,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364731672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:13,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:13,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599590956] [2025-03-08 06:30:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:13,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:13,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:13,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:13,755 INFO L87 Difference]: Start difference. First operand 1088 states and 1467 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:14,972 INFO L93 Difference]: Finished difference Result 1768 states and 2387 transitions. [2025-03-08 06:30:14,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:14,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:14,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:14,974 INFO L225 Difference]: With dead ends: 1768 [2025-03-08 06:30:14,974 INFO L226 Difference]: Without dead ends: 1648 [2025-03-08 06:30:14,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:14,975 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 4691 mSDsluCounter, 3800 mSDsCounter, 0 mSdLazyCounter, 3911 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4691 SdHoareTripleChecker+Valid, 4963 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:14,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4691 Valid, 4963 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3911 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2025-03-08 06:30:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1088. [2025-03-08 06:30:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.3843248347497639) internal successors, (1466), 1087 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1466 transitions. [2025-03-08 06:30:14,983 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1466 transitions. Word has length 113 [2025-03-08 06:30:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:14,984 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1466 transitions. [2025-03-08 06:30:14,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1466 transitions. [2025-03-08 06:30:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:30:14,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:14,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:14,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:30:14,985 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1721453876, now seen corresponding path program 1 times [2025-03-08 06:30:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132582247] [2025-03-08 06:30:14,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:15,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:30:15,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:30:15,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:15,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:15,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132582247] [2025-03-08 06:30:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132582247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:15,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:15,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:15,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842023510] [2025-03-08 06:30:15,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:15,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:15,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:15,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:15,180 INFO L87 Difference]: Start difference. First operand 1088 states and 1466 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:16,489 INFO L93 Difference]: Finished difference Result 1902 states and 2566 transitions. [2025-03-08 06:30:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:16,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-08 06:30:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:16,491 INFO L225 Difference]: With dead ends: 1902 [2025-03-08 06:30:16,491 INFO L226 Difference]: Without dead ends: 1668 [2025-03-08 06:30:16,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:16,492 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 4553 mSDsluCounter, 4436 mSDsCounter, 0 mSdLazyCounter, 4297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4553 SdHoareTripleChecker+Valid, 5644 SdHoareTripleChecker+Invalid, 4303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:16,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4553 Valid, 5644 Invalid, 4303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4297 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:16,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-03-08 06:30:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1084. [2025-03-08 06:30:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3848341232227488) internal successors, (1461), 1083 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1461 transitions. [2025-03-08 06:30:16,499 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1461 transitions. Word has length 113 [2025-03-08 06:30:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:16,500 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1461 transitions. [2025-03-08 06:30:16,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1461 transitions. [2025-03-08 06:30:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:16,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:16,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:30:16,501 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1924274555, now seen corresponding path program 1 times [2025-03-08 06:30:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:16,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956957953] [2025-03-08 06:30:16,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:16,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:16,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:16,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:16,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956957953] [2025-03-08 06:30:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956957953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785619456] [2025-03-08 06:30:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:16,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:16,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:16,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:16,683 INFO L87 Difference]: Start difference. First operand 1084 states and 1461 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:17,918 INFO L93 Difference]: Finished difference Result 1705 states and 2296 transitions. [2025-03-08 06:30:17,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:17,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:17,920 INFO L225 Difference]: With dead ends: 1705 [2025-03-08 06:30:17,920 INFO L226 Difference]: Without dead ends: 1612 [2025-03-08 06:30:17,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:17,921 INFO L435 NwaCegarLoop]: 1055 mSDtfsCounter, 3369 mSDsluCounter, 3408 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3369 SdHoareTripleChecker+Valid, 4463 SdHoareTripleChecker+Invalid, 3666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:17,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3369 Valid, 4463 Invalid, 3666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-08 06:30:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1084. [2025-03-08 06:30:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3838862559241707) internal successors, (1460), 1083 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1460 transitions. [2025-03-08 06:30:17,929 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1460 transitions. Word has length 114 [2025-03-08 06:30:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:17,929 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1460 transitions. [2025-03-08 06:30:17,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1460 transitions. [2025-03-08 06:30:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:17,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:17,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:30:17,930 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1328139880, now seen corresponding path program 1 times [2025-03-08 06:30:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475579095] [2025-03-08 06:30:17,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:17,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:17,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:17,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:17,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:18,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:18,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475579095] [2025-03-08 06:30:18,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475579095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:18,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:18,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:18,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603353212] [2025-03-08 06:30:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:18,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:18,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:18,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:18,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:18,110 INFO L87 Difference]: Start difference. First operand 1084 states and 1460 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:19,117 INFO L93 Difference]: Finished difference Result 1644 states and 2185 transitions. [2025-03-08 06:30:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:19,119 INFO L225 Difference]: With dead ends: 1644 [2025-03-08 06:30:19,119 INFO L226 Difference]: Without dead ends: 1556 [2025-03-08 06:30:19,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:19,120 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 5946 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 2788 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5946 SdHoareTripleChecker+Valid, 3197 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:19,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5946 Valid, 3197 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2788 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:30:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2025-03-08 06:30:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1084. [2025-03-08 06:30:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3829383886255924) internal successors, (1459), 1083 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1459 transitions. [2025-03-08 06:30:19,128 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1459 transitions. Word has length 114 [2025-03-08 06:30:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:19,128 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1459 transitions. [2025-03-08 06:30:19,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1459 transitions. [2025-03-08 06:30:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:19,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:19,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:19,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:30:19,129 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:19,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1557291001, now seen corresponding path program 1 times [2025-03-08 06:30:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:19,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685041849] [2025-03-08 06:30:19,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:19,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:19,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:19,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:19,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:19,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685041849] [2025-03-08 06:30:19,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685041849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:19,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:19,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:19,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392381062] [2025-03-08 06:30:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:19,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:19,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:19,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:19,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:19,347 INFO L87 Difference]: Start difference. First operand 1084 states and 1459 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:20,643 INFO L93 Difference]: Finished difference Result 1705 states and 2292 transitions. [2025-03-08 06:30:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:20,646 INFO L225 Difference]: With dead ends: 1705 [2025-03-08 06:30:20,646 INFO L226 Difference]: Without dead ends: 1612 [2025-03-08 06:30:20,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:20,646 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 6325 mSDsluCounter, 4082 mSDsCounter, 0 mSdLazyCounter, 4058 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6325 SdHoareTripleChecker+Valid, 5089 SdHoareTripleChecker+Invalid, 4065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:20,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6325 Valid, 5089 Invalid, 4065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4058 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-08 06:30:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1084. [2025-03-08 06:30:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3819905213270143) internal successors, (1458), 1083 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1458 transitions. [2025-03-08 06:30:20,654 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1458 transitions. Word has length 114 [2025-03-08 06:30:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:20,654 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1458 transitions. [2025-03-08 06:30:20,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:20,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1458 transitions. [2025-03-08 06:30:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:20,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:20,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, 1, 1] [2025-03-08 06:30:20,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:30:20,656 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:20,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1374204295, now seen corresponding path program 1 times [2025-03-08 06:30:20,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052499902] [2025-03-08 06:30:20,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:20,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:20,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:20,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:20,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:20,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:20,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052499902] [2025-03-08 06:30:20,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052499902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785126592] [2025-03-08 06:30:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:20,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:20,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:20,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:20,839 INFO L87 Difference]: Start difference. First operand 1084 states and 1458 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:21,976 INFO L93 Difference]: Finished difference Result 1710 states and 2294 transitions. [2025-03-08 06:30:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:21,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:21,978 INFO L225 Difference]: With dead ends: 1710 [2025-03-08 06:30:21,978 INFO L226 Difference]: Without dead ends: 1612 [2025-03-08 06:30:21,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:21,979 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 5206 mSDsluCounter, 3266 mSDsCounter, 0 mSdLazyCounter, 3445 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5206 SdHoareTripleChecker+Valid, 4273 SdHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:21,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5206 Valid, 4273 Invalid, 3452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3445 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 06:30:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-08 06:30:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1084. [2025-03-08 06:30:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.381042654028436) internal successors, (1457), 1083 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1457 transitions. [2025-03-08 06:30:21,988 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1457 transitions. Word has length 114 [2025-03-08 06:30:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:21,988 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1457 transitions. [2025-03-08 06:30:21,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1457 transitions. [2025-03-08 06:30:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:21,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:21,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:21,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:30:21,990 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-08 06:30:21,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash -8607099, now seen corresponding path program 1 times [2025-03-08 06:30:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536780093] [2025-03-08 06:30:21,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:22,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:22,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:22,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:22,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:22,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536780093] [2025-03-08 06:30:22,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536780093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:22,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:22,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890051600] [2025-03-08 06:30:22,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:22,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:22,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:22,190 INFO L87 Difference]: Start difference. First operand 1084 states and 1457 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:23,458 INFO L93 Difference]: Finished difference Result 1755 states and 2363 transitions. [2025-03-08 06:30:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:23,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:23,459 INFO L225 Difference]: With dead ends: 1755 [2025-03-08 06:30:23,459 INFO L226 Difference]: Without dead ends: 1644 [2025-03-08 06:30:23,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:23,460 INFO L435 NwaCegarLoop]: 1216 mSDtfsCounter, 5885 mSDsluCounter, 3956 mSDsCounter, 0 mSdLazyCounter, 4047 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5885 SdHoareTripleChecker+Valid, 5172 SdHoareTripleChecker+Invalid, 4053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:23,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5885 Valid, 5172 Invalid, 4053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4047 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-03-08 06:30:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1084. [2025-03-08 06:30:23,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3800947867298579) internal successors, (1456), 1083 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1456 transitions. [2025-03-08 06:30:23,467 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1456 transitions. Word has length 114 [2025-03-08 06:30:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:23,467 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1456 transitions. [2025-03-08 06:30:23,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1456 transitions. [2025-03-08 06:30:23,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:23,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:23,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:23,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:30:23,468 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:23,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1664278468, now seen corresponding path program 1 times [2025-03-08 06:30:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:23,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052394718] [2025-03-08 06:30:23,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:23,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:23,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:23,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:23,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:23,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052394718] [2025-03-08 06:30:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052394718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143720512] [2025-03-08 06:30:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:23,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:23,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:23,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:23,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:23,668 INFO L87 Difference]: Start difference. First operand 1084 states and 1456 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:24,999 INFO L93 Difference]: Finished difference Result 1706 states and 2289 transitions. [2025-03-08 06:30:24,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:24,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:25,001 INFO L225 Difference]: With dead ends: 1706 [2025-03-08 06:30:25,001 INFO L226 Difference]: Without dead ends: 1612 [2025-03-08 06:30:25,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:25,002 INFO L435 NwaCegarLoop]: 1079 mSDtfsCounter, 6180 mSDsluCounter, 4296 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6180 SdHoareTripleChecker+Valid, 5375 SdHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:25,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6180 Valid, 5375 Invalid, 4280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-08 06:30:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1084. [2025-03-08 06:30:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3791469194312795) internal successors, (1455), 1083 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1455 transitions. [2025-03-08 06:30:25,010 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1455 transitions. Word has length 114 [2025-03-08 06:30:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:25,010 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1455 transitions. [2025-03-08 06:30:25,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1455 transitions. [2025-03-08 06:30:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:25,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:25,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:25,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:30:25,011 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:25,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash -516019742, now seen corresponding path program 1 times [2025-03-08 06:30:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:25,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976588704] [2025-03-08 06:30:25,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:25,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:25,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:25,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:25,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:25,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976588704] [2025-03-08 06:30:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976588704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:25,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:25,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053196071] [2025-03-08 06:30:25,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:25,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:25,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:25,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:25,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:25,188 INFO L87 Difference]: Start difference. First operand 1084 states and 1455 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:26,356 INFO L93 Difference]: Finished difference Result 1706 states and 2288 transitions. [2025-03-08 06:30:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:30:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:26,358 INFO L225 Difference]: With dead ends: 1706 [2025-03-08 06:30:26,358 INFO L226 Difference]: Without dead ends: 1612 [2025-03-08 06:30:26,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:30:26,359 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 5131 mSDsluCounter, 3308 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5131 SdHoareTripleChecker+Valid, 4329 SdHoareTripleChecker+Invalid, 3500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:26,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5131 Valid, 4329 Invalid, 3500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-08 06:30:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1084. [2025-03-08 06:30:26,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3781990521327014) internal successors, (1454), 1083 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1454 transitions. [2025-03-08 06:30:26,368 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1454 transitions. Word has length 114 [2025-03-08 06:30:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:26,368 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1454 transitions. [2025-03-08 06:30:26,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1454 transitions. [2025-03-08 06:30:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:26,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:26,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:26,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:30:26,369 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:26,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash -913610505, now seen corresponding path program 1 times [2025-03-08 06:30:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:26,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746234891] [2025-03-08 06:30:26,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:26,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:26,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:26,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:26,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:26,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746234891] [2025-03-08 06:30:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746234891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:26,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423601642] [2025-03-08 06:30:26,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:26,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:26,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:26,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:26,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:26,566 INFO L87 Difference]: Start difference. First operand 1084 states and 1454 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:27,887 INFO L93 Difference]: Finished difference Result 1705 states and 2285 transitions. [2025-03-08 06:30:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:27,887 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:27,888 INFO L225 Difference]: With dead ends: 1705 [2025-03-08 06:30:27,888 INFO L226 Difference]: Without dead ends: 1612 [2025-03-08 06:30:27,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:27,889 INFO L435 NwaCegarLoop]: 1076 mSDtfsCounter, 4760 mSDsluCounter, 4289 mSDsCounter, 0 mSdLazyCounter, 4253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4760 SdHoareTripleChecker+Valid, 5365 SdHoareTripleChecker+Invalid, 4258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:27,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4760 Valid, 5365 Invalid, 4258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4253 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 06:30:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-08 06:30:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1084. [2025-03-08 06:30:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1055 states have (on average 1.3772511848341231) internal successors, (1453), 1083 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1453 transitions. [2025-03-08 06:30:27,896 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1453 transitions. Word has length 114 [2025-03-08 06:30:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:27,896 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1453 transitions. [2025-03-08 06:30:27,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1453 transitions. [2025-03-08 06:30:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:27,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:27,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:27,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 06:30:27,897 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:27,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:27,897 INFO L85 PathProgramCache]: Analyzing trace with hash -35206524, now seen corresponding path program 1 times [2025-03-08 06:30:27,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:27,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599350910] [2025-03-08 06:30:27,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:27,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:27,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:27,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:27,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:28,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:28,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:28,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599350910] [2025-03-08 06:30:28,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599350910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:28,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:28,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:30:28,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812905728] [2025-03-08 06:30:28,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:28,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:30:28,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:28,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:30:28,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:30:28,196 INFO L87 Difference]: Start difference. First operand 1084 states and 1453 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:30,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:30,026 INFO L93 Difference]: Finished difference Result 1964 states and 2655 transitions. [2025-03-08 06:30:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:30:30,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:30,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:30,029 INFO L225 Difference]: With dead ends: 1964 [2025-03-08 06:30:30,029 INFO L226 Difference]: Without dead ends: 1866 [2025-03-08 06:30:30,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:30:30,030 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 9556 mSDsluCounter, 4580 mSDsCounter, 0 mSdLazyCounter, 4565 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9556 SdHoareTripleChecker+Valid, 5600 SdHoareTripleChecker+Invalid, 4902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 4565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:30,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9556 Valid, 5600 Invalid, 4902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 4565 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:30:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2025-03-08 06:30:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1088. [2025-03-08 06:30:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.3758262511803587) internal successors, (1457), 1087 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1457 transitions. [2025-03-08 06:30:30,037 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1457 transitions. Word has length 114 [2025-03-08 06:30:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:30,037 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1457 transitions. [2025-03-08 06:30:30,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1457 transitions. [2025-03-08 06:30:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:30,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:30,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:30,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 06:30:30,038 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:30,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:30,039 INFO L85 PathProgramCache]: Analyzing trace with hash 755909903, now seen corresponding path program 1 times [2025-03-08 06:30:30,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:30,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745417814] [2025-03-08 06:30:30,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:30,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:30,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:30,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:30,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:30:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:30:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:30:30,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745417814] [2025-03-08 06:30:30,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745417814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:30:30,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:30:30,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:30:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621094570] [2025-03-08 06:30:30,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:30:30,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:30:30,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:30:30,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:30:30,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:30:30,218 INFO L87 Difference]: Start difference. First operand 1088 states and 1457 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:30:31,380 INFO L93 Difference]: Finished difference Result 1706 states and 2284 transitions. [2025-03-08 06:30:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:30:31,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-08 06:30:31,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:30:31,382 INFO L225 Difference]: With dead ends: 1706 [2025-03-08 06:30:31,382 INFO L226 Difference]: Without dead ends: 1612 [2025-03-08 06:30:31,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 06:30:31,383 INFO L435 NwaCegarLoop]: 1066 mSDtfsCounter, 3333 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 4510 SdHoareTripleChecker+Invalid, 3638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:30:31,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 4510 Invalid, 3638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 06:30:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2025-03-08 06:30:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1088. [2025-03-08 06:30:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1059 states have (on average 1.3748819641170915) internal successors, (1456), 1087 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1456 transitions. [2025-03-08 06:30:31,389 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1456 transitions. Word has length 114 [2025-03-08 06:30:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:30:31,390 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 1456 transitions. [2025-03-08 06:30:31,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:30:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1456 transitions. [2025-03-08 06:30:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:30:31,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:30:31,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:30:31,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 06:30:31,391 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 06:30:31,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:30:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1424388307, now seen corresponding path program 1 times [2025-03-08 06:30:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:30:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844618239] [2025-03-08 06:30:31,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:30:31,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:30:31,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:30:31,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:30:31,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:30:31,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat