./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea86972a210f89fc9e3e5afc5e01f00ca5c135dc207351adf2f98bafbd9a008a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:36:45,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:36:45,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:36:45,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:36:45,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:36:45,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:36:45,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:36:45,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:36:45,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:36:45,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:36:45,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:36:45,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:36:45,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:36:45,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:36:45,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:36:45,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:36:45,270 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:36:45,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:36:45,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:36:45,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:36:45,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:36:45,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:36:45,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:45,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:36:45,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:36:45,271 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 -> ea86972a210f89fc9e3e5afc5e01f00ca5c135dc207351adf2f98bafbd9a008a [2025-03-16 19:36:45,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:36:45,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:36:45,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:36:45,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:36:45,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:36:45,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:36:46,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3323e015a/34244cbf914143f2bca2c6b2aa2892f5/FLAG0e07762cf [2025-03-16 19:36:47,202 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:36:47,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:36:47,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3323e015a/34244cbf914143f2bca2c6b2aa2892f5/FLAG0e07762cf [2025-03-16 19:36:47,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3323e015a/34244cbf914143f2bca2c6b2aa2892f5 [2025-03-16 19:36:47,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:36:47,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:36:47,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:47,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:36:47,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:36:47,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:47" (1/1) ... [2025-03-16 19:36:47,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:47, skipping insertion in model container [2025-03-16 19:36:47,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:47" (1/1) ... [2025-03-16 19:36:47,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:36:48,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[147376,147389] [2025-03-16 19:36:48,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[216640,216653] [2025-03-16 19:36:48,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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[251269,251282] [2025-03-16 19:36:48,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[268618,268631] [2025-03-16 19:36:48,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[277293,277306] [2025-03-16 19:36:48,383 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[281602,281615] [2025-03-16 19:36:48,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[285742,285755] [2025-03-16 19:36:48,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[353833,353846] [2025-03-16 19:36:48,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[387694,387707] [2025-03-16 19:36:48,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[404802,404815] [2025-03-16 19:36:48,576 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[413481,413494] [2025-03-16 19:36:48,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[417791,417804] [2025-03-16 19:36:48,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[421932,421945] [2025-03-16 19:36:48,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[456014,456027] [2025-03-16 19:36:48,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[473125,473138] [2025-03-16 19:36:48,674 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[481792,481805] [2025-03-16 19:36:48,682 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[486086,486099] [2025-03-16 19:36:48,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[490211,490224] [2025-03-16 19:36:48,717 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[508509,508522] [2025-03-16 19:36:48,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[517152,517165] [2025-03-16 19:36:48,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[521446,521459] [2025-03-16 19:36:48,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[525571,525584] [2025-03-16 19:36:48,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[530444,530457] [2025-03-16 19:36:48,759 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[534605,534618] [2025-03-16 19:36:48,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[538899,538912] [2025-03-16 19:36:48,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[543024,543037] [2025-03-16 19:36:48,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[547518,547531] [2025-03-16 19:36:48,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[551659,551672] [2025-03-16 19:36:48,792 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[555964,555977] [2025-03-16 19:36:48,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:48,852 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:36:49,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[147376,147389] [2025-03-16 19:36:49,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[216640,216653] [2025-03-16 19:36:49,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[251269,251282] [2025-03-16 19:36:49,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[268618,268631] [2025-03-16 19:36:49,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[277293,277306] [2025-03-16 19:36:49,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[281602,281615] [2025-03-16 19:36:49,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[285742,285755] [2025-03-16 19:36:49,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[353833,353846] [2025-03-16 19:36:49,420 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[387694,387707] [2025-03-16 19:36:49,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[404802,404815] [2025-03-16 19:36:49,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[413481,413494] [2025-03-16 19:36:49,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[417791,417804] [2025-03-16 19:36:49,467 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[421932,421945] [2025-03-16 19:36:49,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[456014,456027] [2025-03-16 19:36:49,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[473125,473138] [2025-03-16 19:36:49,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[481792,481805] [2025-03-16 19:36:49,552 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[486086,486099] [2025-03-16 19:36:49,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[490211,490224] [2025-03-16 19:36:49,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[508509,508522] [2025-03-16 19:36:49,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[517152,517165] [2025-03-16 19:36:49,603 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[521446,521459] [2025-03-16 19:36:49,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[525571,525584] [2025-03-16 19:36:49,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[530444,530457] [2025-03-16 19:36:49,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[534605,534618] [2025-03-16 19:36:49,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[538899,538912] [2025-03-16 19:36:49,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[543024,543037] [2025-03-16 19:36:49,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[547518,547531] [2025-03-16 19:36:49,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[551659,551672] [2025-03-16 19:36:49,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[555964,555977] [2025-03-16 19:36:49,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:49,726 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:36:49,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49 WrapperNode [2025-03-16 19:36:49,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:49,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:49,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:36:49,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:36:49,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:49,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,097 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25985 [2025-03-16 19:36:50,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:50,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:36:50,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:36:50,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:36:50,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,243 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:36:50,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:36:50,505 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:36:50,505 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:36:50,505 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:36:50,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (1/1) ... [2025-03-16 19:36:50,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:50,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:36:50,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:36:50,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:36:50,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:36:50,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:36:50,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:36:50,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:36:50,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:36:50,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:36:59,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39085: havoc main_~check__tmp~162#1;havoc main_~node7__m7~168#1;havoc main_~node6__m6~141#1;havoc main_~node5__m5~127#1;havoc main_~node4__m4~120#1;havoc main_~node3__m3~116#1;havoc main_~node2__m2~114#1;havoc main_~node1__m1~113#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~161#1; [2025-03-16 19:36:59,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44370: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-16 19:36:59,240 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34858: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~149#1; [2025-03-16 19:36:59,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8961: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~30#1; [2025-03-16 19:36:59,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17419: havoc main_~node7__m7~72#1;havoc main_~node6__m6~61#1;havoc main_~node5__m5~55#1;havoc main_~node4__m4~52#1;havoc main_~node3__m3~50#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~49#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-03-16 19:36:59,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22708: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~95#1; [2025-03-16 19:36:59,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8441: havoc main_~node7__m7~33#1;havoc main_~node6__m6~28#1;havoc main_~node5__m5~25#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1; [2025-03-16 19:36:59,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-16 19:36:59,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37511: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~135#1; [2025-03-16 19:36:59,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42799: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~184#1;havoc main_~node7__m7~184#1;havoc main_~node6__m6~154#1;havoc main_~node5__m5~139#1;havoc main_~node4__m4~131#1;havoc main_~node3__m3~127#1;havoc main_~node2__m2~125#1;havoc main_~node1__m1~124#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~183#1; [2025-03-16 19:36:59,241 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26946: havoc main_~node7__m7~114#1;havoc main_~node6__m6~96#1;havoc main_~node5__m5~86#1;havoc main_~node4__m4~81#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~78#1;havoc main_~node1__m1~77#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~100#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: havoc main_~node7__m7~1#1;havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8978: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~35#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38046: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~156#1;havoc main_~node7__m7~163#1;havoc main_~node6__m6~137#1;havoc main_~node5__m5~123#1;havoc main_~node4__m4~116#1;havoc main_~node3__m3~113#1;havoc main_~node2__m2~111#1;havoc main_~node1__m1~110#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~155#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30648: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~118#1;havoc main_~node7__m7~130#1;havoc main_~node6__m6~109#1;havoc main_~node5__m5~98#1;havoc main_~node4__m4~93#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~89#1;havoc main_~node1__m1~88#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~117#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15855: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~55#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7400: havoc main_~node7__m7~28#1;havoc main_~node6__m6~24#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42283: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~182#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44398: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L531: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34356: havoc main_~node7__m7~147#1;havoc main_~node6__m6~123#1;havoc main_~node5__m5~111#1;havoc main_~node4__m4~105#1;havoc main_~node3__m3~102#1;havoc main_~node2__m2~100#1;havoc main_~node1__m1~99#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~136#1; [2025-03-16 19:36:59,242 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37528: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~161#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30130: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~128#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16390: havoc main_~check__tmp~54#1;havoc main_~node7__m7~67#1;havoc main_~node6__m6~57#1;havoc main_~node5__m5~51#1;havoc main_~node4__m4~48#1;havoc main_~node3__m3~47#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~46#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~53#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5298: havoc main_~node7__m7~19#1;havoc main_~node6__m6~17#1;havoc main_~node5__m5~15#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21154: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~77#1;havoc main_~node7__m7~88#1;havoc main_~node6__m6~74#1;havoc main_~node5__m5~67#1;havoc main_~node4__m4~63#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~60#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~76#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15872: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~65#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33319: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~133#1;havoc main_~node7__m7~142#1;havoc main_~node6__m6~119#1;havoc main_~node5__m5~107#1;havoc main_~node4__m4~101#1;havoc main_~node3__m3~98#1;havoc main_~node2__m2~97#1;havoc main_~node1__m1~96#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~132#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: havoc main_~node7__m7~10#1;havoc main_~node6__m6~9#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-16 19:36:59,243 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20636: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~86#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15355: havoc main_~node7__m7~63#1;havoc main_~node6__m6~53#1;havoc main_~node5__m5~48#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~43#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~49#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44426: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4787: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~15#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6902: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~26#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32803: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~140#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6378: havoc main_~node7__m7~24#1;havoc main_~node6__m6~21#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~17#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11670: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~33#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29642: havoc main_~node7__m7~126#1;havoc main_~node6__m6~106#1;havoc main_~node5__m5~95#1;havoc main_~node4__m4~90#1;havoc main_~node3__m3~87#1;havoc main_~node2__m2~86#1;havoc main_~node1__m1~85#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~112#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4804: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~17#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25945: havoc main_~node7__m7~109#1;havoc main_~node6__m6~92#1;havoc main_~node5__m5~83#1;havoc main_~node4__m4~78#1;havoc main_~node3__m3~76#1;havoc main_~node2__m2~75#1;havoc main_~node1__m1~74#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~96#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25418: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~81#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20134: havoc main_~node7__m7~84#1;havoc main_~node6__m6~71#1;havoc main_~node5__m5~64#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~57#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~71#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37046: havoc main_~check__tmp~150#1;havoc main_~node7__m7~159#1;havoc main_~node6__m6~133#1;havoc main_~node5__m5~120#1;havoc main_~node4__m4~113#1;havoc main_~node3__m3~110#1;havoc main_~node2__m2~108#1;havoc main_~node1__m1~107#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~149#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4282: havoc main_~node7__m7~15#1;havoc main_~node6__m6~13#1;havoc main_~node5__m5~12#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14324: havoc main_~check__tmp~46#1;havoc main_~node7__m7~58#1;havoc main_~node6__m6~49#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~40#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~45#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2697: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~8#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2173: havoc main_~node7__m7~6#1;havoc main_~node6__m6~6#1;havoc main_~node5__m5~5#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44455: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11687: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~34#1; [2025-03-16 19:36:59,244 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13806: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~56#1; [2025-03-16 19:36:59,245 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41818: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~178#1;havoc main_~node7__m7~180#1;havoc main_~node6__m6~151#1;havoc main_~node5__m5~136#1;havoc main_~node4__m4~128#1;havoc main_~node3__m3~124#1;havoc main_~node2__m2~122#1;havoc main_~node1__m1~121#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~177#1; [2025-03-16 19:36:59,245 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25435: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~90#1; [2025-03-16 19:36:59,245 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11704: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~36#1; [2025-03-16 19:36:59,245 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25452: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~107#1; [2025-03-16 19:36:59,246 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13298: havoc main_~node7__m7~54#1;havoc main_~node6__m6~46#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~37#1;havoc main_~node1__m1~37#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~42#1; [2025-03-16 19:36:59,246 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28097: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~85#1; [2025-03-16 19:36:59,246 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36027: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~145#1;havoc main_~node7__m7~154#1;havoc main_~node6__m6~129#1;havoc main_~node5__m5~116#1;havoc main_~node4__m4~110#1;havoc main_~node3__m3~107#1;havoc main_~node2__m2~105#1;havoc main_~node1__m1~104#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~144#1; [2025-03-16 19:36:59,246 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24930: havoc main_~node7__m7~105#1;havoc main_~node6__m6~88#1;havoc main_~node5__m5~79#1;havoc main_~node4__m4~75#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~72#1;havoc main_~node1__m1~71#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~92#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40259: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~145#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11721: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18595: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~65#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11196: havoc main_~check__tmp~35#1;havoc main_~node7__m7~45#1;havoc main_~node6__m6~38#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12253: havoc main_~node7__m7~49#1;havoc main_~node6__m6~42#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~36#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~34#1;havoc main_~node1__m1~34#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~39#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40794: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~172#1;havoc main_~node7__m7~175#1;havoc main_~node6__m6~147#1;havoc main_~node5__m5~132#1;havoc main_~node4__m4~125#1;havoc main_~node3__m3~121#1;havoc main_~node2__m2~119#1;havoc main_~node1__m1~118#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~171#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35509: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~152#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32341: havoc main_~check__tmp~127#1;havoc main_~node7__m7~138#1;havoc main_~node6__m6~116#1;havoc main_~node5__m5~104#1;havoc main_~node4__m4~98#1;havoc main_~node3__m3~95#1;havoc main_~node2__m2~94#1;havoc main_~node1__m1~93#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~126#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28641: havoc main_~node7__m7~121#1;havoc main_~node6__m6~102#1;havoc main_~node5__m5~92#1;havoc main_~node4__m4~87#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~83#1;havoc main_~node1__m1~82#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~108#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28114: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~90#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19130: havoc main_~check__tmp~66#1;havoc main_~node7__m7~79#1;havoc main_~node6__m6~67#1;havoc main_~node5__m5~60#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~54#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40276: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~173#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11738: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~47#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18612: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~77#1; [2025-03-16 19:36:59,247 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38698: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~160#1;havoc main_~node7__m7~166#1;havoc main_~node6__m6~139#1;havoc main_~node5__m5~125#1;havoc main_~node4__m4~118#1;havoc main_~node3__m3~115#1;havoc main_~node2__m2~113#1;havoc main_~node1__m1~112#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~159#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28131: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~100#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42930: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~155#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43464: havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~188#1;havoc main_~node7__m7~187#1;havoc main_~node6__m6~157#1;havoc main_~node5__m5~141#1;havoc main_~node4__m4~133#1;havoc main_~node3__m3~129#1;havoc main_~node2__m2~127#1;havoc main_~node1__m1~126#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~187#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18095: havoc main_~node7__m7~75#1;havoc main_~node6__m6~63#1;havoc main_~node5__m5~57#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~51#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38182: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~164#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10172: havoc main_~check__tmp~30#1;havoc main_~node7__m7~40#1;havoc main_~node6__m6~34#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~29#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30790: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~99#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23919: havoc main_~node7__m7~100#1;havoc main_~node6__m6~84#1;havoc main_~node5__m5~76#1;havoc main_~node4__m4~72#1;havoc main_~node3__m3~70#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~68#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~89#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28148: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~119#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42947: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~185#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35021: havoc main_~node7__m7~150#1;havoc main_~node6__m6~126#1;havoc main_~node5__m5~113#1;havoc main_~node4__m4~107#1;havoc main_~node3__m3~104#1;havoc main_~node2__m2~102#1;havoc main_~node1__m1~101#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~139#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9654: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~38#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17055: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~58#1;havoc main_~node7__m7~70#1;havoc main_~node6__m6~59#1;havoc main_~node5__m5~53#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~49#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~48#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L27626: havoc main_~check__tmp~104#1;havoc main_~node7__m7~117#1;havoc main_~node6__m6~98#1;havoc main_~node5__m5~88#1;havoc main_~node4__m4~83#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~80#1;havoc main_~node1__m1~79#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~103#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31328: havoc main_~check__tmp~121#1;havoc main_~node7__m7~133#1;havoc main_~node6__m6~112#1;havoc main_~node5__m5~101#1;havoc main_~node4__m4~95#1;havoc main_~node3__m3~92#1;havoc main_~node2__m2~91#1;havoc main_~node1__m1~90#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~120#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23404: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~98#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21293: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~75#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30807: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~110#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16537: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~68#1; [2025-03-16 19:36:59,248 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22881: havoc main_~node7__m7~96#1;havoc main_~node6__m6~81#1;havoc main_~node5__m5~73#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~65#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~86#1; [2025-03-16 19:36:59,252 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39794: havoc main_~check__tmp~166#1;havoc main_~node7__m7~171#1;havoc main_~node6__m6~143#1;havoc main_~node5__m5~129#1;havoc main_~node4__m4~122#1;havoc main_~node3__m3~118#1;havoc main_~node2__m2~116#1;havoc main_~node1__m1~115#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~165#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21828: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~81#1;havoc main_~node7__m7~91#1;havoc main_~node6__m6~77#1;havoc main_~node5__m5~69#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~62#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~80#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9146: havoc main_~node7__m7~36#1;havoc main_~node6__m6~31#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~26#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33459: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~99#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8091: havoc main_~node7__m7~31#1;havoc main_~node6__m6~27#1;havoc main_~node5__m5~24#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21310: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~89#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30824: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~131#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33476: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~102#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16035: havoc main_~node7__m7~66#1;havoc main_~node6__m6~56#1;havoc main_~node5__m5~50#1;havoc main_~node4__m4~47#1;havoc main_~node3__m3~46#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~45#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~52#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7580: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~25#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5998: havoc main_~check__tmp~16#1;havoc main_~node7__m7~22#1;havoc main_~node6__m6~19#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1242: havoc main_~node7____CPAchecker_TMP_0~1#1;havoc main_~node7__m7~2#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26616: havoc main_~check__tmp~99#1;havoc main_~node7__m7~112#1;havoc main_~node6__m6~94#1;havoc main_~node5__m5~85#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~77#1;havoc main_~node1__m1~76#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~98#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34020: havoc main_~node7__m7~145#1;havoc main_~node6__m6~122#1;havoc main_~node5__m5~110#1;havoc main_~node4__m4~104#1;havoc main_~node3__m3~101#1;havoc main_~node2__m2~99#1;havoc main_~node1__m1~98#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~135#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5480: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~20#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37720: havoc main_~check__tmp~154#1;havoc main_~node7__m7~162#1;havoc main_~node6__m6~136#1;havoc main_~node5__m5~122#1;havoc main_~node4__m4~115#1;havoc main_~node3__m3~112#1;havoc main_~node2__m2~110#1;havoc main_~node1__m1~109#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~153#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30322: havoc main_~check__tmp~116#1;havoc main_~node7__m7~129#1;havoc main_~node6__m6~108#1;havoc main_~node5__m5~97#1;havoc main_~node4__m4~92#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~88#1;havoc main_~node1__m1~87#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~115#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33493: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~108#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7597: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~29#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42481: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~182#1;havoc main_~node7__m7~183#1;havoc main_~node6__m6~153#1;havoc main_~node5__m5~138#1;havoc main_~node4__m4~130#1;havoc main_~node3__m3~126#1;havoc main_~node2__m2~124#1;havoc main_~node1__m1~123#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~181#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7075: havoc main_~node7__m7~27#1;havoc main_~node6__m6~23#1;havoc main_~node5__m5~21#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15005: havoc main_~node7__m7~61#1;havoc main_~node6__m6~52#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~42#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~48#1; [2025-03-16 19:36:59,253 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3378: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~9#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14477: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~45#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33510: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~120#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4972: havoc main_~node7__m7~18#1;havoc main_~node6__m6~16#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20828: havoc main_~check__tmp~75#1;havoc main_~node7__m7~87#1;havoc main_~node6__m6~73#1;havoc main_~node5__m5~66#1;havoc main_~node4__m4~62#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~59#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~74#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26113: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~110#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804: havoc main_~node7__m7~4#1;havoc main_~node6__m6~4#1;havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41446: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~176#1;havoc main_~node7__m7~178#1;havoc main_~node6__m6~149#1;havoc main_~node5__m5~134#1;havoc main_~node4__m4~127#1;havoc main_~node3__m3~123#1;havoc main_~node2__m2~121#1;havoc main_~node1__m1~120#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~175#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3395: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~10#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14494: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~50#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: havoc main_~node7__m7~9#1;havoc main_~node6__m6~8#1;havoc main_~node5__m5~7#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:36:59,254 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3927: havoc main_~node7__m7~13#1;havoc main_~node6__m6~12#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36169: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~117#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33527: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~143#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13974: havoc main_~node7__m7~57#1;havoc main_~node6__m6~48#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~39#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~44#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33001: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~131#1;havoc main_~node7__m7~141#1;havoc main_~node6__m6~118#1;havoc main_~node5__m5~106#1;havoc main_~node4__m4~100#1;havoc main_~node3__m3~97#1;havoc main_~node2__m2~96#1;havoc main_~node1__m1~95#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~130#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40930: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~176#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36707: havoc main_~check__tmp~148#1;havoc main_~node7__m7~157#1;havoc main_~node6__m6~132#1;havoc main_~node5__m5~119#1;havoc main_~node4__m4~112#1;havoc main_~node3__m3~109#1;havoc main_~node2__m2~107#1;havoc main_~node1__m1~106#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~147#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19795: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~70#1;havoc main_~node7__m7~82#1;havoc main_~node6__m6~69#1;havoc main_~node5__m5~62#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~56#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~69#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44108: havoc main_~node1__m1~129#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~192#1;havoc main_~node7__m7~190#1;havoc main_~node6__m6~159#1;havoc main_~node5__m5~143#1;havoc main_~node4__m4~135#1;havoc main_~node3__m3~131#1;havoc main_~node2__m2~129#1;havoc main_~node1__m1~128#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~191#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3412: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~11#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14511: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~59#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29312: havoc main_~check__tmp~111#1;havoc main_~node7__m7~124#1;havoc main_~node6__m6~104#1;havoc main_~node5__m5~94#1;havoc main_~node4__m4~89#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~85#1;havoc main_~node1__m1~84#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~110#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36186: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~130#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12933: havoc main_~node7__m7~52#1;havoc main_~node6__m6~44#1;havoc main_~node5__m5~40#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~36#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~41#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19277: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~80#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25620: havoc main_~node7__m7~108#1;havoc main_~node6__m6~91#1;havoc main_~node5__m5~82#1;havoc main_~node4__m4~77#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~74#1;havoc main_~node1__m1~73#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~95#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43592: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~188#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38835: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~119#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36203: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~155#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28809: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~122#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38852: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~126#1; [2025-03-16 19:36:59,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18775: havoc main_~node7__m7~78#1;havoc main_~node6__m6~66#1;havoc main_~node5__m5~59#1;havoc main_~node4__m4~56#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~53#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12435: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~50#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10322: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~35#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24594: havoc main_~node7__m7~103#1;havoc main_~node6__m6~87#1;havoc main_~node5__m5~78#1;havoc main_~node4__m4~74#1;havoc main_~node3__m3~72#1;havoc main_~node2__m2~71#1;havoc main_~node1__m1~70#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~91#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31993: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~125#1;havoc main_~node7__m7~136#1;havoc main_~node6__m6~114#1;havoc main_~node5__m5~103#1;havoc main_~node4__m4~97#1;havoc main_~node3__m3~94#1;havoc main_~node2__m2~93#1;havoc main_~node1__m1~92#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~124#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22480: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~85#1;havoc main_~node7__m7~94#1;havoc main_~node6__m6~79#1;havoc main_~node5__m5~71#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~64#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~84#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11911: havoc main_~node7__m7~48#1;havoc main_~node6__m6~41#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~35#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~33#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~38#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44150: havoc main_~node2__m2~130#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10857: havoc main_~check__tmp~33#1;havoc main_~node7__m7~43#1;havoc main_~node6__m6~37#1;havoc main_~node5__m5~33#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~32#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17200: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~51#1; [2025-03-16 19:36:59,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38869: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~140#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35701: havoc main_~check__tmp~143#1;havoc main_~node7__m7~153#1;havoc main_~node6__m6~128#1;havoc main_~node5__m5~115#1;havoc main_~node4__m4~109#1;havoc main_~node3__m3~106#1;havoc main_~node2__m2~104#1;havoc main_~node1__m1~103#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~142#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31475: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~134#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21964: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~92#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10339: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~41#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24084: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~85#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40468: havoc main_~check__tmp~170#1;havoc main_~node7__m7~174#1;havoc main_~node6__m6~146#1;havoc main_~node5__m5~131#1;havoc main_~node4__m4~124#1;havoc main_~node3__m3~120#1;havoc main_~node2__m2~118#1;havoc main_~node1__m1~117#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~169#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38886: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~167#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17745: havoc main_~node7__m7~73#1;havoc main_~node6__m6~62#1;havoc main_~node5__m5~56#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~51#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~50#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~60#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17217: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~54#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28316: havoc main_~node7__m7~120#1;havoc main_~node6__m6~101#1;havoc main_~node5__m5~91#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~82#1;havoc main_~node1__m1~81#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~107#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9822: havoc main_~node7__m7~39#1;havoc main_~node6__m6~33#1;havoc main_~node5__m5~30#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~28#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44182: havoc main_~node3__m3~132#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24101: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~101#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17234: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~60#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23577: havoc main_~node7__m7~99#1;havoc main_~node6__m6~83#1;havoc main_~node5__m5~75#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~69#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~67#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~88#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38380: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~158#1;havoc main_~node7__m7~165#1;havoc main_~node6__m6~138#1;havoc main_~node5__m5~124#1;havoc main_~node4__m4~117#1;havoc main_~node3__m3~114#1;havoc main_~node2__m2~112#1;havoc main_~node1__m1~111#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~157#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L27287: havoc main_~check__tmp~102#1;havoc main_~node7__m7~115#1;havoc main_~node6__m6~97#1;havoc main_~node5__m5~87#1;havoc main_~node4__m4~82#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~79#1;havoc main_~node1__m1~78#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~101#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30987: havoc main_~node7__m7~132#1;havoc main_~node6__m6~111#1;havoc main_~node5__m5~100#1;havoc main_~node4__m4~94#1;havoc main_~node3__m3~91#1;havoc main_~node2__m2~90#1;havoc main_~node1__m1~89#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~119#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43145: havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~186#1;havoc main_~node7__m7~186#1;havoc main_~node6__m6~156#1;havoc main_~node5__m5~140#1;havoc main_~node4__m4~132#1;havoc main_~node3__m3~128#1;havoc main_~node2__m2~126#1;havoc main_~node1__m1~125#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~185#1; [2025-03-16 19:36:59,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8791: havoc main_~check__tmp~25#1;havoc main_~node7__m7~34#1;havoc main_~node6__m6~29#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34691: havoc main_~check__tmp~138#1;havoc main_~node7__m7~148#1;havoc main_~node6__m6~124#1;havoc main_~node5__m5~112#1;havoc main_~node4__m4~106#1;havoc main_~node3__m3~103#1;havoc main_~node2__m2~101#1;havoc main_~node1__m1~100#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~137#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17251: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~71#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6154: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~17#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26766: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~95#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16729: havoc main_~check__tmp~56#1;havoc main_~node7__m7~69#1;havoc main_~node6__m6~58#1;havoc main_~node5__m5~52#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~48#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~47#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~55#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39455: havoc main_~check__tmp~164#1;havoc main_~node7__m7~169#1;havoc main_~node6__m6~142#1;havoc main_~node5__m5~128#1;havoc main_~node4__m4~121#1;havoc main_~node3__m3~117#1;havoc main_~node2__m2~115#1;havoc main_~node1__m1~114#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~163#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8273: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~32#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44214: havoc main_~node4__m4~136#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41580: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~135#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6171: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26783: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~113#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21502: havoc main_~check__tmp~79#1;havoc main_~node7__m7~90#1;havoc main_~node6__m6~76#1;havoc main_~node5__m5~68#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~61#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~78#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34188: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~146#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5648: havoc main_~node7__m7~21#1;havoc main_~node6__m6~18#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~15#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-16 19:36:59,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7765: havoc main_~node7__m7~30#1;havoc main_~node6__m6~26#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-03-16 19:36:59,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41597: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~150#1; [2025-03-16 19:36:59,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6188: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~20#1; [2025-03-16 19:36:59,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37372: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~152#1;havoc main_~node7__m7~160#1;havoc main_~node6__m6~134#1;havoc main_~node5__m5~121#1;havoc main_~node4__m4~114#1;havoc main_~node3__m3~111#1;havoc main_~node2__m2~109#1;havoc main_~node1__m1~108#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~151#1; [2025-03-16 19:36:59,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6720: havoc main_~node7__m7~25#1;havoc main_~node6__m6~22#1;havoc main_~node5__m5~20#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-03-16 19:36:59,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15705: havoc main_~check__tmp~51#1;havoc main_~node7__m7~64#1;havoc main_~node6__m6~54#1;havoc main_~node5__m5~49#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~45#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~44#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~50#1; [2025-03-16 19:36:59,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4607: havoc main_~node7__m7~16#1;havoc main_~node6__m6~14#1;havoc main_~node5__m5~13#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-03-16 19:36:59,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44246: havoc main_~node5__m5~144#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19937: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~63#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26281: havoc main_~node7__m7~111#1;havoc main_~node6__m6~93#1;havoc main_~node5__m5~84#1;havoc main_~node4__m4~79#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~76#1;havoc main_~node1__m1~75#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~97#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29983: havoc main_~check__tmp~114#1;havoc main_~node7__m7~127#1;havoc main_~node6__m6~107#1;havoc main_~node5__m5~96#1;havoc main_~node4__m4~91#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~87#1;havoc main_~node1__m1~86#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~113#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36854: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~158#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15187: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~62#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41614: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~179#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6205: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~23#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29462: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~105#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42147: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~180#1;havoc main_~node7__m7~181#1;havoc main_~node6__m6~152#1;havoc main_~node5__m5~137#1;havoc main_~node4__m4~129#1;havoc main_~node3__m3~125#1;havoc main_~node2__m2~123#1;havoc main_~node1__m1~122#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~179#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1983: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~5#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19954: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~70#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33695: havoc main_~node7__m7~144#1;havoc main_~node6__m6~121#1;havoc main_~node5__m5~109#1;havoc main_~node4__m4~103#1;havoc main_~node3__m3~100#1;havoc main_~node2__m2~98#1;havoc main_~node1__m1~97#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~134#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1457: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~3#1;havoc main_~node6__m6~3#1;havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2515: havoc main_~node7__m7~7#1;havoc main_~node6__m6~7#1;havoc main_~node5__m5~6#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20489: havoc main_~check__tmp~73#1;havoc main_~node7__m7~85#1;havoc main_~node6__m6~72#1;havoc main_~node5__m5~65#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~58#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~72#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14679: havoc main_~node7__m7~60#1;havoc main_~node6__m6~51#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~41#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~47#1; [2025-03-16 19:36:59,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4109: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~14#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29479: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~125#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13624: havoc main_~node7__m7~55#1;havoc main_~node6__m6~47#1;havoc main_~node5__m5~42#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~38#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~43#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3585: havoc main_~node7__m7~12#1;havoc main_~node6__m6~11#1;havoc main_~node5__m5~10#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~5#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19971: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~83#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32132: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~115#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11522: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~37#1;havoc main_~node7__m7~46#1;havoc main_~node6__m6~39#1;havoc main_~node5__m5~35#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~36#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25265: havoc main_~check__tmp~94#1;havoc main_~node7__m7~106#1;havoc main_~node6__m6~89#1;havoc main_~node5__m5~80#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~73#1;havoc main_~node1__m1~72#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~93#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22623: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~65#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36366: havoc main_~node7__m7~156#1;havoc main_~node6__m6~131#1;havoc main_~node5__m5~118#1;havoc main_~node4__m4~111#1;havoc main_~node3__m3~108#1;havoc main_~node2__m2~106#1;havoc main_~node1__m1~105#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~146#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32667: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~129#1;havoc main_~node7__m7~139#1;havoc main_~node6__m6~117#1;havoc main_~node5__m5~105#1;havoc main_~node4__m4~99#1;havoc main_~node3__m3~96#1;havoc main_~node2__m2~95#1;havoc main_~node1__m1~94#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~128#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13113: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~45#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41128: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~174#1;havoc main_~node7__m7~177#1;havoc main_~node6__m6~148#1;havoc main_~node5__m5~133#1;havoc main_~node4__m4~126#1;havoc main_~node3__m3~122#1;havoc main_~node2__m2~120#1;havoc main_~node1__m1~119#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~173#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11004: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~44#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28977: havoc main_~node7__m7~123#1;havoc main_~node6__m6~103#1;havoc main_~node5__m5~93#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~84#1;havoc main_~node1__m1~83#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~109#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32149: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~137#1; [2025-03-16 19:36:59,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22640: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~66#1; [2025-03-16 19:36:59,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19469: havoc main_~check__tmp~68#1;havoc main_~node7__m7~81#1;havoc main_~node6__m6~68#1;havoc main_~node5__m5~61#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~55#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~67#1; [2025-03-16 19:36:59,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13130: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~53#1; [2025-03-16 19:36:59,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:36:59,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44314: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~160#1; [2025-03-16 19:36:59,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24762: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~104#1; [2025-03-16 19:36:59,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12608: havoc main_~node7__m7~51#1;havoc main_~node6__m6~43#1;havoc main_~node5__m5~39#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~35#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~40#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43793: havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~190#1;havoc main_~node7__m7~189#1;havoc main_~node6__m6~158#1;havoc main_~node5__m5~142#1;havoc main_~node4__m4~134#1;havoc main_~node3__m3~130#1;havoc main_~node2__m2~128#1;havoc main_~node1__m1~127#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~189#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22657: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~68#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10502: havoc main_~node7__m7~42#1;havoc main_~node6__m6~36#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~31#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L27952: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~106#1;havoc main_~node7__m7~118#1;havoc main_~node6__m6~99#1;havoc main_~node5__m5~89#1;havoc main_~node4__m4~84#1;havoc main_~node3__m3~82#1;havoc main_~node2__m2~81#1;havoc main_~node1__m1~80#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~105#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18445: havoc main_~check__tmp~63#1;havoc main_~node7__m7~76#1;havoc main_~node6__m6~64#1;havoc main_~node5__m5~58#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~52#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~62#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44342: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22674: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~72#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35362: havoc main_~check__tmp~141#1;havoc main_~node7__m7~151#1;havoc main_~node6__m6~127#1;havoc main_~node5__m5~114#1;havoc main_~node4__m4~108#1;havoc main_~node3__m3~105#1;havoc main_~node2__m2~103#1;havoc main_~node1__m1~102#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~140#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L27434: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~116#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40120: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~168#1;havoc main_~node7__m7~172#1;havoc main_~node6__m6~144#1;havoc main_~node5__m5~130#1;havoc main_~node4__m4~123#1;havoc main_~node3__m3~119#1;havoc main_~node2__m2~117#1;havoc main_~node1__m1~116#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~167#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31667: havoc main_~check__tmp~123#1;havoc main_~node7__m7~135#1;havoc main_~node6__m6~113#1;havoc main_~node5__m5~102#1;havoc main_~node4__m4~96#1;havoc main_~node3__m3~93#1;havoc main_~node2__m2~92#1;havoc main_~node1__m1~91#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~122#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17927: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~74#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24269: havoc main_~node7__m7~102#1;havoc main_~node6__m6~86#1;havoc main_~node5__m5~77#1;havoc main_~node4__m4~73#1;havoc main_~node3__m3~71#1;havoc main_~node2__m2~70#1;havoc main_~node1__m1~69#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~90#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9472: havoc main_~node7__m7~37#1;havoc main_~node6__m6~32#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~27#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8944: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~27#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34841: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~125#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39602: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~170#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22162: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~83#1;havoc main_~node7__m7~93#1;havoc main_~node6__m6~78#1;havoc main_~node5__m5~70#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~63#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~82#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22691: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~80#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23223: havoc main_~node7__m7~97#1;havoc main_~node6__m6~82#1;havoc main_~node5__m5~74#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~68#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~66#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~87#1; [2025-03-16 19:36:59,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-16 19:37:00,207 INFO L? ?]: Removed 4832 outVars from TransFormulas that were not future-live. [2025-03-16 19:37:00,207 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:37:00,290 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:37:00,291 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:37:00,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:37:00 BoogieIcfgContainer [2025-03-16 19:37:00,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:37:00,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:37:00,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:37:00,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:37:00,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:36:47" (1/3) ... [2025-03-16 19:37:00,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723c1968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:37:00, skipping insertion in model container [2025-03-16 19:37:00,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:49" (2/3) ... [2025-03-16 19:37:00,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723c1968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:37:00, skipping insertion in model container [2025-03-16 19:37:00,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:37:00" (3/3) ... [2025-03-16 19:37:00,302 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:37:00,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:37:00,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 5022 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-16 19:37:00,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:37:00,468 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;@53fb9ba3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:37:00,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-16 19:37:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 5022 states, 4992 states have (on average 1.8157051282051282) internal successors, (9064), 5021 states have internal predecessors, (9064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:37:00,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:00,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:00,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:00,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:00,536 INFO L85 PathProgramCache]: Analyzing trace with hash 110232614, now seen corresponding path program 1 times [2025-03-16 19:37:00,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355457951] [2025-03-16 19:37:00,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:00,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:00,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:37:00,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:37:00,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:00,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:01,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:01,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355457951] [2025-03-16 19:37:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355457951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:01,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:01,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050338783] [2025-03-16 19:37:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:01,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:01,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:01,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:01,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:01,193 INFO L87 Difference]: Start difference. First operand has 5022 states, 4992 states have (on average 1.8157051282051282) internal successors, (9064), 5021 states have internal predecessors, (9064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:04,057 INFO L93 Difference]: Finished difference Result 6066 states and 10809 transitions. [2025-03-16 19:37:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 19:37:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:04,084 INFO L225 Difference]: With dead ends: 6066 [2025-03-16 19:37:04,084 INFO L226 Difference]: Without dead ends: 3559 [2025-03-16 19:37:04,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:04,097 INFO L435 NwaCegarLoop]: 3235 mSDtfsCounter, 18771 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18771 SdHoareTripleChecker+Valid, 3281 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:04,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18771 Valid, 3281 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 19:37:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2025-03-16 19:37:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3559. [2025-03-16 19:37:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3559 states, 3530 states have (on average 1.3348441926345609) internal successors, (4712), 3558 states have internal predecessors, (4712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:04,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 4712 transitions. [2025-03-16 19:37:04,229 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 4712 transitions. Word has length 100 [2025-03-16 19:37:04,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:04,230 INFO L471 AbstractCegarLoop]: Abstraction has 3559 states and 4712 transitions. [2025-03-16 19:37:04,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 4712 transitions. [2025-03-16 19:37:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:37:04,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:04,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:04,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:37:04,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:04,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1244716250, now seen corresponding path program 1 times [2025-03-16 19:37:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738388066] [2025-03-16 19:37:04,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:04,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:37:04,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:37:04,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:04,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738388066] [2025-03-16 19:37:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738388066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:04,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:04,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:04,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758111477] [2025-03-16 19:37:04,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:04,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:04,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:04,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:04,446 INFO L87 Difference]: Start difference. First operand 3559 states and 4712 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:05,948 INFO L93 Difference]: Finished difference Result 4082 states and 5367 transitions. [2025-03-16 19:37:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:05,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 19:37:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:05,957 INFO L225 Difference]: With dead ends: 4082 [2025-03-16 19:37:05,957 INFO L226 Difference]: Without dead ends: 2335 [2025-03-16 19:37:05,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:05,960 INFO L435 NwaCegarLoop]: 1369 mSDtfsCounter, 9223 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9223 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:05,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9223 Valid, 1405 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:37:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2025-03-16 19:37:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2335. [2025-03-16 19:37:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2306 states have (on average 1.352558542931483) internal successors, (3119), 2334 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3119 transitions. [2025-03-16 19:37:05,994 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3119 transitions. Word has length 100 [2025-03-16 19:37:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:05,994 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3119 transitions. [2025-03-16 19:37:05,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3119 transitions. [2025-03-16 19:37:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:37:05,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:05,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:05,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:37:05,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 467906440, now seen corresponding path program 1 times [2025-03-16 19:37:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193539442] [2025-03-16 19:37:05,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:06,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:37:06,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:37:06,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:06,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:06,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:06,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193539442] [2025-03-16 19:37:06,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193539442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:06,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:06,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:06,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209938127] [2025-03-16 19:37:06,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:06,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:06,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:06,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:06,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:06,175 INFO L87 Difference]: Start difference. First operand 2335 states and 3119 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:07,085 INFO L93 Difference]: Finished difference Result 3018 states and 4029 transitions. [2025-03-16 19:37:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:07,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 19:37:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:07,090 INFO L225 Difference]: With dead ends: 3018 [2025-03-16 19:37:07,090 INFO L226 Difference]: Without dead ends: 1839 [2025-03-16 19:37:07,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:07,092 INFO L435 NwaCegarLoop]: 1161 mSDtfsCounter, 7351 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7351 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:07,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7351 Valid, 1189 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:37:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-03-16 19:37:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1839. [2025-03-16 19:37:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1810 states have (on average 1.3734806629834253) internal successors, (2486), 1838 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2486 transitions. [2025-03-16 19:37:07,112 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2486 transitions. Word has length 100 [2025-03-16 19:37:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:07,113 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2486 transitions. [2025-03-16 19:37:07,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2486 transitions. [2025-03-16 19:37:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:37:07,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:07,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:07,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:37:07,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:07,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1658200214, now seen corresponding path program 1 times [2025-03-16 19:37:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:07,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051257985] [2025-03-16 19:37:07,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:07,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:37:07,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:37:07,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:07,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:07,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051257985] [2025-03-16 19:37:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051257985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:07,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9441861] [2025-03-16 19:37:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:07,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:07,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:07,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:07,303 INFO L87 Difference]: Start difference. First operand 1839 states and 2486 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:07,912 INFO L93 Difference]: Finished difference Result 2096 states and 2777 transitions. [2025-03-16 19:37:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:37:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:07,916 INFO L225 Difference]: With dead ends: 2096 [2025-03-16 19:37:07,916 INFO L226 Difference]: Without dead ends: 1218 [2025-03-16 19:37:07,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:07,917 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 4802 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4802 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:07,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4802 Valid, 834 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:37:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-03-16 19:37:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2025-03-16 19:37:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1189 states have (on average 1.3868797308662741) internal successors, (1649), 1217 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1649 transitions. [2025-03-16 19:37:07,931 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1649 transitions. Word has length 101 [2025-03-16 19:37:07,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:07,931 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1649 transitions. [2025-03-16 19:37:07,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1649 transitions. [2025-03-16 19:37:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:37:07,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:07,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:07,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:37:07,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:07,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:07,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1348651381, now seen corresponding path program 1 times [2025-03-16 19:37:07,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:07,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31263467] [2025-03-16 19:37:07,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:07,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:07,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:37:07,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:37:07,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:07,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:08,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31263467] [2025-03-16 19:37:08,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31263467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:08,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:08,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805327763] [2025-03-16 19:37:08,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:08,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:08,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:08,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:08,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:08,117 INFO L87 Difference]: Start difference. First operand 1218 states and 1649 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:08,607 INFO L93 Difference]: Finished difference Result 1785 states and 2429 transitions. [2025-03-16 19:37:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:08,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-16 19:37:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:08,612 INFO L225 Difference]: With dead ends: 1785 [2025-03-16 19:37:08,612 INFO L226 Difference]: Without dead ends: 1124 [2025-03-16 19:37:08,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:08,613 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 4542 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4542 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:08,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4542 Valid, 847 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:37:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2025-03-16 19:37:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1124. [2025-03-16 19:37:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 1095 states have (on average 1.4045662100456622) internal successors, (1538), 1123 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1538 transitions. [2025-03-16 19:37:08,627 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1538 transitions. Word has length 102 [2025-03-16 19:37:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:08,628 INFO L471 AbstractCegarLoop]: Abstraction has 1124 states and 1538 transitions. [2025-03-16 19:37:08,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1538 transitions. [2025-03-16 19:37:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:37:08,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:08,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:08,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:37:08,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:08,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:08,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1863523716, now seen corresponding path program 1 times [2025-03-16 19:37:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652537884] [2025-03-16 19:37:08,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:08,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:08,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:37:08,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:37:08,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:08,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652537884] [2025-03-16 19:37:08,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652537884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:08,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624832237] [2025-03-16 19:37:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:08,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:08,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:08,794 INFO L87 Difference]: Start difference. First operand 1124 states and 1538 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:09,527 INFO L93 Difference]: Finished difference Result 2280 states and 3138 transitions. [2025-03-16 19:37:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:09,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-16 19:37:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:09,532 INFO L225 Difference]: With dead ends: 2280 [2025-03-16 19:37:09,532 INFO L226 Difference]: Without dead ends: 1665 [2025-03-16 19:37:09,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:09,533 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 6015 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6015 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:09,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6015 Valid, 1266 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:37:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-16 19:37:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1563. [2025-03-16 19:37:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1534 states have (on average 1.441329856584094) internal successors, (2211), 1562 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2211 transitions. [2025-03-16 19:37:09,554 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2211 transitions. Word has length 103 [2025-03-16 19:37:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:09,554 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2211 transitions. [2025-03-16 19:37:09,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2211 transitions. [2025-03-16 19:37:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:37:09,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:09,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:09,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:37:09,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:09,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:09,556 INFO L85 PathProgramCache]: Analyzing trace with hash 67633432, now seen corresponding path program 1 times [2025-03-16 19:37:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:09,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423022066] [2025-03-16 19:37:09,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:09,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:37:09,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:37:09,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:09,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:09,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:09,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423022066] [2025-03-16 19:37:09,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423022066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:09,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:09,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:37:09,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830600927] [2025-03-16 19:37:09,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:09,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:37:09,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:09,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:37:09,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:37:09,684 INFO L87 Difference]: Start difference. First operand 1563 states and 2211 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:10,377 INFO L93 Difference]: Finished difference Result 2227 states and 3139 transitions. [2025-03-16 19:37:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-16 19:37:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:10,381 INFO L225 Difference]: With dead ends: 2227 [2025-03-16 19:37:10,381 INFO L226 Difference]: Without dead ends: 1555 [2025-03-16 19:37:10,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:10,382 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 4254 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4254 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:10,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4254 Valid, 648 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:37:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2025-03-16 19:37:10,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2025-03-16 19:37:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4416775884665793) internal successors, (2200), 1554 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2200 transitions. [2025-03-16 19:37:10,405 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2200 transitions. Word has length 104 [2025-03-16 19:37:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:10,405 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2200 transitions. [2025-03-16 19:37:10,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2200 transitions. [2025-03-16 19:37:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:37:10,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:10,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:10,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:37:10,407 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:10,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:10,407 INFO L85 PathProgramCache]: Analyzing trace with hash -312492798, now seen corresponding path program 1 times [2025-03-16 19:37:10,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518916669] [2025-03-16 19:37:10,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:10,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:10,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:37:10,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:37:10,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:10,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518916669] [2025-03-16 19:37:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518916669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:10,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:37:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691789606] [2025-03-16 19:37:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:37:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:10,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:37:10,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:37:10,930 INFO L87 Difference]: Start difference. First operand 1555 states and 2200 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:12,585 INFO L93 Difference]: Finished difference Result 2846 states and 4034 transitions. [2025-03-16 19:37:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:12,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-16 19:37:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:12,591 INFO L225 Difference]: With dead ends: 2846 [2025-03-16 19:37:12,591 INFO L226 Difference]: Without dead ends: 2426 [2025-03-16 19:37:12,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:37:12,593 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 3970 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3970 SdHoareTripleChecker+Valid, 4337 SdHoareTripleChecker+Invalid, 3648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:12,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3970 Valid, 4337 Invalid, 3648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:37:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2025-03-16 19:37:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1555. [2025-03-16 19:37:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4403669724770642) internal successors, (2198), 1554 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2198 transitions. [2025-03-16 19:37:12,620 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2198 transitions. Word has length 105 [2025-03-16 19:37:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:12,620 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2198 transitions. [2025-03-16 19:37:12,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2198 transitions. [2025-03-16 19:37:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:37:12,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:12,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:12,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:37:12,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:12,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1916357244, now seen corresponding path program 1 times [2025-03-16 19:37:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:12,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452713400] [2025-03-16 19:37:12,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:12,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:37:12,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:37:12,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:12,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:12,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452713400] [2025-03-16 19:37:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452713400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:37:12,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112376793] [2025-03-16 19:37:12,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:12,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:37:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:12,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:37:12,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:12,960 INFO L87 Difference]: Start difference. First operand 1555 states and 2198 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:14,310 INFO L93 Difference]: Finished difference Result 2678 states and 3661 transitions. [2025-03-16 19:37:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:37:14,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-16 19:37:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:14,315 INFO L225 Difference]: With dead ends: 2678 [2025-03-16 19:37:14,315 INFO L226 Difference]: Without dead ends: 2014 [2025-03-16 19:37:14,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:37:14,316 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 4867 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4867 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:14,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4867 Valid, 2193 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-03-16 19:37:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1555. [2025-03-16 19:37:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4397116644823067) internal successors, (2197), 1554 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2197 transitions. [2025-03-16 19:37:14,339 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2197 transitions. Word has length 105 [2025-03-16 19:37:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:14,339 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2197 transitions. [2025-03-16 19:37:14,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2197 transitions. [2025-03-16 19:37:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:37:14,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:14,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:14,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:37:14,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:14,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash 768571876, now seen corresponding path program 1 times [2025-03-16 19:37:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757354382] [2025-03-16 19:37:14,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:14,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:37:14,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:37:14,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:14,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:14,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:14,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757354382] [2025-03-16 19:37:14,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757354382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:14,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:14,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701922915] [2025-03-16 19:37:14,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:14,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:14,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:14,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:14,648 INFO L87 Difference]: Start difference. First operand 1555 states and 2197 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:15,739 INFO L93 Difference]: Finished difference Result 2027 states and 2886 transitions. [2025-03-16 19:37:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:15,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-16 19:37:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:15,743 INFO L225 Difference]: With dead ends: 2027 [2025-03-16 19:37:15,743 INFO L226 Difference]: Without dead ends: 1643 [2025-03-16 19:37:15,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:15,744 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 3864 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3864 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 3203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:15,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3864 Valid, 3768 Invalid, 3203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:15,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-03-16 19:37:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1555. [2025-03-16 19:37:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4390563564875491) internal successors, (2196), 1554 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2196 transitions. [2025-03-16 19:37:15,760 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2196 transitions. Word has length 105 [2025-03-16 19:37:15,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:15,760 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2196 transitions. [2025-03-16 19:37:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2196 transitions. [2025-03-16 19:37:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:37:15,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:15,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] [2025-03-16 19:37:15,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:37:15,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1502781595, now seen corresponding path program 1 times [2025-03-16 19:37:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:15,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821797041] [2025-03-16 19:37:15,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:15,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:37:15,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:37:15,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:15,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:16,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:16,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821797041] [2025-03-16 19:37:16,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821797041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:16,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:16,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102881913] [2025-03-16 19:37:16,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:16,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:16,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:16,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:16,067 INFO L87 Difference]: Start difference. First operand 1555 states and 2196 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:17,514 INFO L93 Difference]: Finished difference Result 2509 states and 3528 transitions. [2025-03-16 19:37:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-16 19:37:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:17,520 INFO L225 Difference]: With dead ends: 2509 [2025-03-16 19:37:17,520 INFO L226 Difference]: Without dead ends: 2331 [2025-03-16 19:37:17,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:17,521 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 3912 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3912 SdHoareTripleChecker+Valid, 3363 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:17,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3912 Valid, 3363 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2953 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2025-03-16 19:37:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 1555. [2025-03-16 19:37:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4384010484927916) internal successors, (2195), 1554 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2195 transitions. [2025-03-16 19:37:17,538 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2195 transitions. Word has length 105 [2025-03-16 19:37:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:17,539 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2195 transitions. [2025-03-16 19:37:17,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2195 transitions. [2025-03-16 19:37:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:17,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:17,541 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-16 19:37:17,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:37:17,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:17,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash -210045549, now seen corresponding path program 1 times [2025-03-16 19:37:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27608621] [2025-03-16 19:37:17,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:17,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:17,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:17,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:17,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:17,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27608621] [2025-03-16 19:37:17,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27608621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:17,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:17,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058201907] [2025-03-16 19:37:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:17,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:17,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:17,810 INFO L87 Difference]: Start difference. First operand 1555 states and 2195 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:19,097 INFO L93 Difference]: Finished difference Result 2293 states and 3247 transitions. [2025-03-16 19:37:19,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:19,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:37:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:19,101 INFO L225 Difference]: With dead ends: 2293 [2025-03-16 19:37:19,102 INFO L226 Difference]: Without dead ends: 1643 [2025-03-16 19:37:19,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:37:19,103 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 1641 mSDsluCounter, 3658 mSDsCounter, 0 mSdLazyCounter, 3420 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1641 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:19,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1641 Valid, 4767 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3420 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-03-16 19:37:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1555. [2025-03-16 19:37:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4370904325032765) internal successors, (2193), 1554 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2193 transitions. [2025-03-16 19:37:19,119 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2193 transitions. Word has length 107 [2025-03-16 19:37:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:19,120 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2193 transitions. [2025-03-16 19:37:19,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2193 transitions. [2025-03-16 19:37:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:19,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:19,121 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-16 19:37:19,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:37:19,122 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:19,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1918022988, now seen corresponding path program 1 times [2025-03-16 19:37:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99881299] [2025-03-16 19:37:19,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:19,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:19,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:19,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:19,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:19,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99881299] [2025-03-16 19:37:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99881299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932669648] [2025-03-16 19:37:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:19,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:19,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:19,434 INFO L87 Difference]: Start difference. First operand 1555 states and 2193 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:21,078 INFO L93 Difference]: Finished difference Result 2798 states and 3967 transitions. [2025-03-16 19:37:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:21,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:37:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:21,084 INFO L225 Difference]: With dead ends: 2798 [2025-03-16 19:37:21,084 INFO L226 Difference]: Without dead ends: 2430 [2025-03-16 19:37:21,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:21,085 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 4463 mSDsluCounter, 4975 mSDsCounter, 0 mSdLazyCounter, 4681 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4463 SdHoareTripleChecker+Valid, 6542 SdHoareTripleChecker+Invalid, 4684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:21,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4463 Valid, 6542 Invalid, 4684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4681 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:37:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2025-03-16 19:37:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1555. [2025-03-16 19:37:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4357798165137614) internal successors, (2191), 1554 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2191 transitions. [2025-03-16 19:37:21,103 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2191 transitions. Word has length 107 [2025-03-16 19:37:21,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:21,103 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2191 transitions. [2025-03-16 19:37:21,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2191 transitions. [2025-03-16 19:37:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:21,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:21,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:21,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:37:21,105 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:21,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash 124100469, now seen corresponding path program 1 times [2025-03-16 19:37:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230454694] [2025-03-16 19:37:21,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:21,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:21,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:21,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:21,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:21,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:21,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:21,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230454694] [2025-03-16 19:37:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230454694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:21,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:21,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316087756] [2025-03-16 19:37:21,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:21,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:21,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:21,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:21,315 INFO L87 Difference]: Start difference. First operand 1555 states and 2191 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:22,445 INFO L93 Difference]: Finished difference Result 2589 states and 3653 transitions. [2025-03-16 19:37:22,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:22,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:37:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:22,451 INFO L225 Difference]: With dead ends: 2589 [2025-03-16 19:37:22,451 INFO L226 Difference]: Without dead ends: 2379 [2025-03-16 19:37:22,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:22,453 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 3831 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 2972 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3831 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:22,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3831 Valid, 3490 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2972 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-16 19:37:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1555. [2025-03-16 19:37:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4344692005242463) internal successors, (2189), 1554 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2189 transitions. [2025-03-16 19:37:22,520 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2189 transitions. Word has length 107 [2025-03-16 19:37:22,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:22,520 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2189 transitions. [2025-03-16 19:37:22,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2189 transitions. [2025-03-16 19:37:22,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:22,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:22,522 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-16 19:37:22,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:37:22,522 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:22,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash -748079996, now seen corresponding path program 1 times [2025-03-16 19:37:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609954145] [2025-03-16 19:37:22,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:22,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:22,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:22,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:22,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:22,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609954145] [2025-03-16 19:37:22,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609954145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:22,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:22,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:22,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672091171] [2025-03-16 19:37:22,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:22,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:22,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:22,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:22,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:22,913 INFO L87 Difference]: Start difference. First operand 1555 states and 2189 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 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-16 19:37:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:25,265 INFO L93 Difference]: Finished difference Result 3434 states and 4913 transitions. [2025-03-16 19:37:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:25,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 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-16 19:37:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:25,277 INFO L225 Difference]: With dead ends: 3434 [2025-03-16 19:37:25,277 INFO L226 Difference]: Without dead ends: 3150 [2025-03-16 19:37:25,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:25,279 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 8302 mSDsluCounter, 6130 mSDsCounter, 0 mSdLazyCounter, 6411 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8302 SdHoareTripleChecker+Valid, 7464 SdHoareTripleChecker+Invalid, 6707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 6411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:25,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8302 Valid, 7464 Invalid, 6707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 6411 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 19:37:25,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2025-03-16 19:37:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1559. [2025-03-16 19:37:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4333333333333333) internal successors, (2193), 1558 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2193 transitions. [2025-03-16 19:37:25,300 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2193 transitions. Word has length 107 [2025-03-16 19:37:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:25,301 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2193 transitions. [2025-03-16 19:37:25,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 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-16 19:37:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2193 transitions. [2025-03-16 19:37:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:25,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:25,302 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-16 19:37:25,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:37:25,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:25,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1897714846, now seen corresponding path program 1 times [2025-03-16 19:37:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:25,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174297393] [2025-03-16 19:37:25,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:25,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:25,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:25,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:25,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:25,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:25,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:25,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174297393] [2025-03-16 19:37:25,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174297393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:25,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:25,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:25,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974302647] [2025-03-16 19:37:25,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:25,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:25,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:25,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:25,556 INFO L87 Difference]: Start difference. First operand 1559 states and 2193 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:26,663 INFO L93 Difference]: Finished difference Result 2574 states and 3626 transitions. [2025-03-16 19:37:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:37:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:26,667 INFO L225 Difference]: With dead ends: 2574 [2025-03-16 19:37:26,667 INFO L226 Difference]: Without dead ends: 2383 [2025-03-16 19:37:26,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:26,668 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 3828 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 2967 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3828 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:26,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3828 Valid, 3490 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2967 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:26,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-16 19:37:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 1559. [2025-03-16 19:37:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4326797385620915) internal successors, (2192), 1558 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2192 transitions. [2025-03-16 19:37:26,685 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2192 transitions. Word has length 107 [2025-03-16 19:37:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:26,685 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2192 transitions. [2025-03-16 19:37:26,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2192 transitions. [2025-03-16 19:37:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:26,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:26,687 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-16 19:37:26,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:37:26,687 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:26,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:26,688 INFO L85 PathProgramCache]: Analyzing trace with hash 758450216, now seen corresponding path program 1 times [2025-03-16 19:37:26,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:26,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692204494] [2025-03-16 19:37:26,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:26,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:26,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:26,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:26,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:26,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:26,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:26,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692204494] [2025-03-16 19:37:26,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692204494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:26,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:26,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:26,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431339670] [2025-03-16 19:37:26,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:26,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:26,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:26,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:26,918 INFO L87 Difference]: Start difference. First operand 1559 states and 2192 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:28,175 INFO L93 Difference]: Finished difference Result 2623 states and 3704 transitions. [2025-03-16 19:37:28,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:28,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:37:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:28,179 INFO L225 Difference]: With dead ends: 2623 [2025-03-16 19:37:28,179 INFO L226 Difference]: Without dead ends: 2407 [2025-03-16 19:37:28,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:28,180 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 3449 mSDsluCounter, 3339 mSDsCounter, 0 mSdLazyCounter, 3576 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3449 SdHoareTripleChecker+Valid, 4341 SdHoareTripleChecker+Invalid, 3580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:28,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3449 Valid, 4341 Invalid, 3580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3576 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2025-03-16 19:37:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 1559. [2025-03-16 19:37:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4320261437908497) internal successors, (2191), 1558 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2191 transitions. [2025-03-16 19:37:28,194 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2191 transitions. Word has length 107 [2025-03-16 19:37:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:28,194 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2191 transitions. [2025-03-16 19:37:28,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2191 transitions. [2025-03-16 19:37:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:28,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:28,196 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-16 19:37:28,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:37:28,196 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:28,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1963798002, now seen corresponding path program 1 times [2025-03-16 19:37:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:28,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561596572] [2025-03-16 19:37:28,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:28,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:28,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:28,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:28,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561596572] [2025-03-16 19:37:28,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561596572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:28,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:28,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:28,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675335829] [2025-03-16 19:37:28,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:28,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:28,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:28,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:28,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:28,497 INFO L87 Difference]: Start difference. First operand 1559 states and 2191 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:29,624 INFO L93 Difference]: Finished difference Result 2414 states and 3352 transitions. [2025-03-16 19:37:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:37:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:29,628 INFO L225 Difference]: With dead ends: 2414 [2025-03-16 19:37:29,628 INFO L226 Difference]: Without dead ends: 2246 [2025-03-16 19:37:29,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:29,629 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 4051 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 2904 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4051 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:29,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4051 Valid, 3128 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2904 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-03-16 19:37:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 1559. [2025-03-16 19:37:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4313725490196079) internal successors, (2190), 1558 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2190 transitions. [2025-03-16 19:37:29,644 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2190 transitions. Word has length 107 [2025-03-16 19:37:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:29,644 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2190 transitions. [2025-03-16 19:37:29,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2190 transitions. [2025-03-16 19:37:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:37:29,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:29,646 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-16 19:37:29,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:37:29,646 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:29,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:29,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2073194703, now seen corresponding path program 1 times [2025-03-16 19:37:29,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:29,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551196037] [2025-03-16 19:37:29,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:29,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:37:29,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:37:29,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:29,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:29,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-16 19:37:29,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:29,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551196037] [2025-03-16 19:37:29,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551196037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:29,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:29,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036038875] [2025-03-16 19:37:29,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:29,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:29,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:29,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:29,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:29,840 INFO L87 Difference]: Start difference. First operand 1559 states and 2190 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:30,920 INFO L93 Difference]: Finished difference Result 2414 states and 3350 transitions. [2025-03-16 19:37:30,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:30,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:37:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:30,924 INFO L225 Difference]: With dead ends: 2414 [2025-03-16 19:37:30,924 INFO L226 Difference]: Without dead ends: 2246 [2025-03-16 19:37:30,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:30,925 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 6040 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 2899 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6040 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:30,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6040 Valid, 3128 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2899 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-03-16 19:37:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 1559. [2025-03-16 19:37:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.430718954248366) internal successors, (2189), 1558 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2189 transitions. [2025-03-16 19:37:30,938 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2189 transitions. Word has length 107 [2025-03-16 19:37:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:30,938 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2189 transitions. [2025-03-16 19:37:30,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2189 transitions. [2025-03-16 19:37:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 19:37:30,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:30,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:30,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:37:30,940 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:30,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash -599965736, now seen corresponding path program 1 times [2025-03-16 19:37:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719664042] [2025-03-16 19:37:30,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:30,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 19:37:30,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 19:37:30,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:30,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:31,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719664042] [2025-03-16 19:37:31,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719664042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:31,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:31,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829471934] [2025-03-16 19:37:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:31,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:31,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:31,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:31,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:31,141 INFO L87 Difference]: Start difference. First operand 1559 states and 2189 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:32,597 INFO L93 Difference]: Finished difference Result 2714 states and 3835 transitions. [2025-03-16 19:37:32,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:32,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-16 19:37:32,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:32,601 INFO L225 Difference]: With dead ends: 2714 [2025-03-16 19:37:32,601 INFO L226 Difference]: Without dead ends: 2430 [2025-03-16 19:37:32,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:32,602 INFO L435 NwaCegarLoop]: 1231 mSDtfsCounter, 4510 mSDsluCounter, 4044 mSDsCounter, 0 mSdLazyCounter, 4311 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4510 SdHoareTripleChecker+Valid, 5275 SdHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:32,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4510 Valid, 5275 Invalid, 4314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4311 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2025-03-16 19:37:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1555. [2025-03-16 19:37:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4311926605504588) internal successors, (2184), 1554 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2184 transitions. [2025-03-16 19:37:32,616 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2184 transitions. Word has length 108 [2025-03-16 19:37:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:32,616 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2184 transitions. [2025-03-16 19:37:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2184 transitions. [2025-03-16 19:37:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:32,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:32,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:32,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:37:32,618 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:32,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1448112540, now seen corresponding path program 1 times [2025-03-16 19:37:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:32,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009320850] [2025-03-16 19:37:32,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:32,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:32,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:32,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:32,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:32,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009320850] [2025-03-16 19:37:32,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009320850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:32,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:32,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767235042] [2025-03-16 19:37:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:32,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:32,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:32,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:32,836 INFO L87 Difference]: Start difference. First operand 1555 states and 2184 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:34,236 INFO L93 Difference]: Finished difference Result 2683 states and 3783 transitions. [2025-03-16 19:37:34,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:34,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:34,240 INFO L225 Difference]: With dead ends: 2683 [2025-03-16 19:37:34,240 INFO L226 Difference]: Without dead ends: 2403 [2025-03-16 19:37:34,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:34,241 INFO L435 NwaCegarLoop]: 1308 mSDtfsCounter, 4455 mSDsluCounter, 4488 mSDsCounter, 0 mSdLazyCounter, 4320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4455 SdHoareTripleChecker+Valid, 5796 SdHoareTripleChecker+Invalid, 4324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:34,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4455 Valid, 5796 Invalid, 4324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4320 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-03-16 19:37:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1555. [2025-03-16 19:37:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4298820445609437) internal successors, (2182), 1554 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2182 transitions. [2025-03-16 19:37:34,254 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2182 transitions. Word has length 109 [2025-03-16 19:37:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:34,254 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2182 transitions. [2025-03-16 19:37:34,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2182 transitions. [2025-03-16 19:37:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:34,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:34,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:34,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:37:34,256 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:34,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -935280856, now seen corresponding path program 1 times [2025-03-16 19:37:34,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:34,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176598692] [2025-03-16 19:37:34,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:34,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:34,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:34,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:34,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:34,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176598692] [2025-03-16 19:37:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176598692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:34,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:34,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:34,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540453889] [2025-03-16 19:37:34,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:34,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:34,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:34,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:34,467 INFO L87 Difference]: Start difference. First operand 1555 states and 2182 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:35,834 INFO L93 Difference]: Finished difference Result 2593 states and 3646 transitions. [2025-03-16 19:37:35,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:35,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:35,840 INFO L225 Difference]: With dead ends: 2593 [2025-03-16 19:37:35,840 INFO L226 Difference]: Without dead ends: 2379 [2025-03-16 19:37:35,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:35,842 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 3056 mSDsluCounter, 3803 mSDsCounter, 0 mSdLazyCounter, 3814 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3056 SdHoareTripleChecker+Valid, 4749 SdHoareTripleChecker+Invalid, 3818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:35,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3056 Valid, 4749 Invalid, 3818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3814 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-16 19:37:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1555. [2025-03-16 19:37:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4285714285714286) internal successors, (2180), 1554 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2180 transitions. [2025-03-16 19:37:35,859 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2180 transitions. Word has length 109 [2025-03-16 19:37:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:35,859 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2180 transitions. [2025-03-16 19:37:35,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2180 transitions. [2025-03-16 19:37:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:35,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:35,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:35,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:37:35,861 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:35,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1940642452, now seen corresponding path program 1 times [2025-03-16 19:37:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765481326] [2025-03-16 19:37:35,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:35,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:35,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:35,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:35,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:35,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765481326] [2025-03-16 19:37:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765481326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:36,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:36,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977577631] [2025-03-16 19:37:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:36,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:36,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:36,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:36,054 INFO L87 Difference]: Start difference. First operand 1555 states and 2180 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:37,148 INFO L93 Difference]: Finished difference Result 2247 states and 3091 transitions. [2025-03-16 19:37:37,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:37,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:37,152 INFO L225 Difference]: With dead ends: 2247 [2025-03-16 19:37:37,152 INFO L226 Difference]: Without dead ends: 2242 [2025-03-16 19:37:37,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:37,152 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 6021 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6021 SdHoareTripleChecker+Valid, 3131 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:37,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6021 Valid, 3131 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2025-03-16 19:37:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1555. [2025-03-16 19:37:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4272608125819135) internal successors, (2178), 1554 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2178 transitions. [2025-03-16 19:37:37,167 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2178 transitions. Word has length 109 [2025-03-16 19:37:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:37,167 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2178 transitions. [2025-03-16 19:37:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2178 transitions. [2025-03-16 19:37:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:37,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:37,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:37,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:37:37,169 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:37,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:37,170 INFO L85 PathProgramCache]: Analyzing trace with hash 874847794, now seen corresponding path program 1 times [2025-03-16 19:37:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:37,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694893805] [2025-03-16 19:37:37,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:37,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:37,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:37,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:37,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:37,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694893805] [2025-03-16 19:37:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694893805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568649380] [2025-03-16 19:37:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:37,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:37,372 INFO L87 Difference]: Start difference. First operand 1555 states and 2178 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:38,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:38,726 INFO L93 Difference]: Finished difference Result 2667 states and 3748 transitions. [2025-03-16 19:37:38,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:38,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:38,728 INFO L225 Difference]: With dead ends: 2667 [2025-03-16 19:37:38,728 INFO L226 Difference]: Without dead ends: 2403 [2025-03-16 19:37:38,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:38,729 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 4984 mSDsluCounter, 3603 mSDsCounter, 0 mSdLazyCounter, 3830 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 4693 SdHoareTripleChecker+Invalid, 3834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:38,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4984 Valid, 4693 Invalid, 3834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3830 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:38,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-03-16 19:37:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1555. [2025-03-16 19:37:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4259501965923984) internal successors, (2176), 1554 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2176 transitions. [2025-03-16 19:37:38,743 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2176 transitions. Word has length 109 [2025-03-16 19:37:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:38,743 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2176 transitions. [2025-03-16 19:37:38,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2176 transitions. [2025-03-16 19:37:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:38,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:38,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:38,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:37:38,745 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1512472470, now seen corresponding path program 1 times [2025-03-16 19:37:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:38,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084531162] [2025-03-16 19:37:38,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:38,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:38,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:38,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:38,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:38,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:38,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084531162] [2025-03-16 19:37:38,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084531162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:38,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:38,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:38,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931951863] [2025-03-16 19:37:38,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:38,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:38,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:38,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:38,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:38,937 INFO L87 Difference]: Start difference. First operand 1555 states and 2176 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:40,084 INFO L93 Difference]: Finished difference Result 2589 states and 3632 transitions. [2025-03-16 19:37:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:40,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:40,086 INFO L225 Difference]: With dead ends: 2589 [2025-03-16 19:37:40,086 INFO L226 Difference]: Without dead ends: 2379 [2025-03-16 19:37:40,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:40,087 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 5521 mSDsluCounter, 3084 mSDsCounter, 0 mSdLazyCounter, 3343 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5521 SdHoareTripleChecker+Valid, 4009 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:40,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5521 Valid, 4009 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3343 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-16 19:37:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1555. [2025-03-16 19:37:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4246395806028833) internal successors, (2174), 1554 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2174 transitions. [2025-03-16 19:37:40,101 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2174 transitions. Word has length 109 [2025-03-16 19:37:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:40,101 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2174 transitions. [2025-03-16 19:37:40,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2174 transitions. [2025-03-16 19:37:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:40,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:40,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:40,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:37:40,103 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:40,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1130991657, now seen corresponding path program 1 times [2025-03-16 19:37:40,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:40,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995964142] [2025-03-16 19:37:40,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:40,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:40,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:40,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:40,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:40,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:40,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995964142] [2025-03-16 19:37:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995964142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240274859] [2025-03-16 19:37:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:40,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:40,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:40,280 INFO L87 Difference]: Start difference. First operand 1555 states and 2174 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:41,516 INFO L93 Difference]: Finished difference Result 2663 states and 3742 transitions. [2025-03-16 19:37:41,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:41,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:41,518 INFO L225 Difference]: With dead ends: 2663 [2025-03-16 19:37:41,518 INFO L226 Difference]: Without dead ends: 2403 [2025-03-16 19:37:41,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:41,519 INFO L435 NwaCegarLoop]: 1093 mSDtfsCounter, 4979 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 3805 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4979 SdHoareTripleChecker+Valid, 4708 SdHoareTripleChecker+Invalid, 3809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:41,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4979 Valid, 4708 Invalid, 3809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3805 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-03-16 19:37:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1555. [2025-03-16 19:37:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4233289646133682) internal successors, (2172), 1554 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2172 transitions. [2025-03-16 19:37:41,530 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2172 transitions. Word has length 109 [2025-03-16 19:37:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:41,530 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2172 transitions. [2025-03-16 19:37:41,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2172 transitions. [2025-03-16 19:37:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:41,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:41,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:41,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:37:41,532 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:41,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash 898036469, now seen corresponding path program 1 times [2025-03-16 19:37:41,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:41,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824903415] [2025-03-16 19:37:41,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:41,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:41,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:41,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:41,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:41,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:41,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-16 19:37:41,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:41,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824903415] [2025-03-16 19:37:41,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824903415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:41,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:41,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:41,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333931318] [2025-03-16 19:37:41,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:41,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:41,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:41,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:41,753 INFO L87 Difference]: Start difference. First operand 1555 states and 2172 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:42,992 INFO L93 Difference]: Finished difference Result 2585 states and 3625 transitions. [2025-03-16 19:37:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:42,994 INFO L225 Difference]: With dead ends: 2585 [2025-03-16 19:37:42,994 INFO L226 Difference]: Without dead ends: 2379 [2025-03-16 19:37:42,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:42,995 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 5378 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 3471 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5378 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:42,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5378 Valid, 4149 Invalid, 3475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3471 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-16 19:37:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1555. [2025-03-16 19:37:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4220183486238531) internal successors, (2170), 1554 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2170 transitions. [2025-03-16 19:37:43,008 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2170 transitions. Word has length 109 [2025-03-16 19:37:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:43,008 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2170 transitions. [2025-03-16 19:37:43,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2170 transitions. [2025-03-16 19:37:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:43,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:43,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:43,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:37:43,009 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:43,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:43,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1575102332, now seen corresponding path program 1 times [2025-03-16 19:37:43,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:43,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156498757] [2025-03-16 19:37:43,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:43,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:43,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:43,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:43,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:43,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156498757] [2025-03-16 19:37:43,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156498757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:43,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:43,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:43,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353464530] [2025-03-16 19:37:43,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:43,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:43,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:43,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:43,343 INFO L87 Difference]: Start difference. First operand 1555 states and 2170 transitions. Second operand has 11 states, 11 states have (on average 9.909090909090908) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:45,296 INFO L93 Difference]: Finished difference Result 3273 states and 4641 transitions. [2025-03-16 19:37:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:45,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.909090909090908) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:45,298 INFO L225 Difference]: With dead ends: 3273 [2025-03-16 19:37:45,298 INFO L226 Difference]: Without dead ends: 3043 [2025-03-16 19:37:45,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:45,299 INFO L435 NwaCegarLoop]: 1132 mSDtfsCounter, 8920 mSDsluCounter, 4470 mSDsCounter, 0 mSdLazyCounter, 4674 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8920 SdHoareTripleChecker+Valid, 5602 SdHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 4674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:45,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8920 Valid, 5602 Invalid, 4991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 4674 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:37:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2025-03-16 19:37:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 1559. [2025-03-16 19:37:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4209150326797386) internal successors, (2174), 1558 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2174 transitions. [2025-03-16 19:37:45,310 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2174 transitions. Word has length 109 [2025-03-16 19:37:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:45,310 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2174 transitions. [2025-03-16 19:37:45,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.909090909090908) internal successors, (109), 10 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2174 transitions. [2025-03-16 19:37:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:45,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:45,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:45,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:37:45,311 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:45,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:45,312 INFO L85 PathProgramCache]: Analyzing trace with hash -555312321, now seen corresponding path program 1 times [2025-03-16 19:37:45,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:45,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404412001] [2025-03-16 19:37:45,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:45,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:45,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:45,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:45,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:45,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404412001] [2025-03-16 19:37:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404412001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:45,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794465157] [2025-03-16 19:37:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:45,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:45,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:45,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:45,493 INFO L87 Difference]: Start difference. First operand 1559 states and 2174 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:46,785 INFO L93 Difference]: Finished difference Result 2574 states and 3603 transitions. [2025-03-16 19:37:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:46,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:46,788 INFO L225 Difference]: With dead ends: 2574 [2025-03-16 19:37:46,788 INFO L226 Difference]: Without dead ends: 2383 [2025-03-16 19:37:46,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:46,789 INFO L435 NwaCegarLoop]: 1091 mSDtfsCounter, 3040 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 3998 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3040 SdHoareTripleChecker+Valid, 5134 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:46,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3040 Valid, 5134 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3998 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-16 19:37:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 1559. [2025-03-16 19:37:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4202614379084968) internal successors, (2173), 1558 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2173 transitions. [2025-03-16 19:37:46,808 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2173 transitions. Word has length 109 [2025-03-16 19:37:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:46,808 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2173 transitions. [2025-03-16 19:37:46,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2173 transitions. [2025-03-16 19:37:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:46,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:46,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:46,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:37:46,810 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:46,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 32624590, now seen corresponding path program 1 times [2025-03-16 19:37:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103416810] [2025-03-16 19:37:46,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:46,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:46,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:46,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103416810] [2025-03-16 19:37:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103416810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559027719] [2025-03-16 19:37:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:47,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:47,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:47,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:47,025 INFO L87 Difference]: Start difference. First operand 1559 states and 2173 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:48,273 INFO L93 Difference]: Finished difference Result 2568 states and 3596 transitions. [2025-03-16 19:37:48,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:48,273 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:48,275 INFO L225 Difference]: With dead ends: 2568 [2025-03-16 19:37:48,275 INFO L226 Difference]: Without dead ends: 2383 [2025-03-16 19:37:48,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:48,277 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 5372 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 3463 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5372 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 3467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:48,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5372 Valid, 4149 Invalid, 3467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:48,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-16 19:37:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 1559. [2025-03-16 19:37:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.419607843137255) internal successors, (2172), 1558 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2172 transitions. [2025-03-16 19:37:48,289 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2172 transitions. Word has length 109 [2025-03-16 19:37:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:48,289 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2172 transitions. [2025-03-16 19:37:48,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2172 transitions. [2025-03-16 19:37:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:48,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:48,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:48,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:37:48,325 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:48,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash -881149344, now seen corresponding path program 1 times [2025-03-16 19:37:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:48,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622968437] [2025-03-16 19:37:48,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:48,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:48,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:48,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:48,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:48,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622968437] [2025-03-16 19:37:48,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622968437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:48,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234357649] [2025-03-16 19:37:48,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:48,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:48,496 INFO L87 Difference]: Start difference. First operand 1559 states and 2172 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:49,625 INFO L93 Difference]: Finished difference Result 2513 states and 3500 transitions. [2025-03-16 19:37:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:49,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:49,627 INFO L225 Difference]: With dead ends: 2513 [2025-03-16 19:37:49,627 INFO L226 Difference]: Without dead ends: 2335 [2025-03-16 19:37:49,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:49,628 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 5514 mSDsluCounter, 2934 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5514 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 3313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:49,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5514 Valid, 3831 Invalid, 3313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2025-03-16 19:37:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1559. [2025-03-16 19:37:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4189542483660131) internal successors, (2171), 1558 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2171 transitions. [2025-03-16 19:37:49,640 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2171 transitions. Word has length 109 [2025-03-16 19:37:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:49,640 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2171 transitions. [2025-03-16 19:37:49,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2171 transitions. [2025-03-16 19:37:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:49,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:49,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:49,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:37:49,642 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:49,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:49,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1574594928, now seen corresponding path program 1 times [2025-03-16 19:37:49,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:49,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207210158] [2025-03-16 19:37:49,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:49,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:49,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:49,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:49,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:49,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:49,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207210158] [2025-03-16 19:37:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207210158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307105139] [2025-03-16 19:37:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:49,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:49,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:49,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:49,804 INFO L87 Difference]: Start difference. First operand 1559 states and 2171 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:50,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:50,875 INFO L93 Difference]: Finished difference Result 2414 states and 3330 transitions. [2025-03-16 19:37:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:50,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:50,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:50,878 INFO L225 Difference]: With dead ends: 2414 [2025-03-16 19:37:50,878 INFO L226 Difference]: Without dead ends: 2246 [2025-03-16 19:37:50,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:50,879 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 3995 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 2888 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3995 SdHoareTripleChecker+Valid, 3159 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:50,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3995 Valid, 3159 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:50,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-03-16 19:37:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 1559. [2025-03-16 19:37:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4183006535947713) internal successors, (2170), 1558 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2170 transitions. [2025-03-16 19:37:50,892 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2170 transitions. Word has length 109 [2025-03-16 19:37:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:50,892 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2170 transitions. [2025-03-16 19:37:50,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2170 transitions. [2025-03-16 19:37:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:50,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:50,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:50,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:37:50,893 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:50,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash -49584617, now seen corresponding path program 1 times [2025-03-16 19:37:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:50,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59411090] [2025-03-16 19:37:50,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:50,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:50,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:50,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:50,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:51,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59411090] [2025-03-16 19:37:51,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59411090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:51,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:51,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:51,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439659580] [2025-03-16 19:37:51,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:51,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:51,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:51,098 INFO L87 Difference]: Start difference. First operand 1559 states and 2170 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:52,502 INFO L93 Difference]: Finished difference Result 2702 states and 3793 transitions. [2025-03-16 19:37:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:52,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:52,505 INFO L225 Difference]: With dead ends: 2702 [2025-03-16 19:37:52,505 INFO L226 Difference]: Without dead ends: 2438 [2025-03-16 19:37:52,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:52,506 INFO L435 NwaCegarLoop]: 1467 mSDtfsCounter, 2963 mSDsluCounter, 4829 mSDsCounter, 0 mSdLazyCounter, 4422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2963 SdHoareTripleChecker+Valid, 6296 SdHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:52,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2963 Valid, 6296 Invalid, 4426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4422 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2025-03-16 19:37:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 1559. [2025-03-16 19:37:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4176470588235295) internal successors, (2169), 1558 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2169 transitions. [2025-03-16 19:37:52,522 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2169 transitions. Word has length 109 [2025-03-16 19:37:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:52,523 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2169 transitions. [2025-03-16 19:37:52,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2169 transitions. [2025-03-16 19:37:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:37:52,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:52,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:52,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:37:52,525 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:52,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:52,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1494727050, now seen corresponding path program 1 times [2025-03-16 19:37:52,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:52,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403373685] [2025-03-16 19:37:52,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:52,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:37:52,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:37:52,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:52,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:52,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:52,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403373685] [2025-03-16 19:37:52,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403373685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:52,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:52,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:52,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546192312] [2025-03-16 19:37:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:52,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:52,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:52,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:52,743 INFO L87 Difference]: Start difference. First operand 1559 states and 2169 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:54,154 INFO L93 Difference]: Finished difference Result 2612 states and 3661 transitions. [2025-03-16 19:37:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:54,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:37:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:54,157 INFO L225 Difference]: With dead ends: 2612 [2025-03-16 19:37:54,157 INFO L226 Difference]: Without dead ends: 2403 [2025-03-16 19:37:54,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:54,158 INFO L435 NwaCegarLoop]: 1357 mSDtfsCounter, 4419 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 4346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4419 SdHoareTripleChecker+Valid, 5911 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:54,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4419 Valid, 5911 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4346 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-03-16 19:37:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1559. [2025-03-16 19:37:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1530 states have (on average 1.4169934640522877) internal successors, (2168), 1558 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2168 transitions. [2025-03-16 19:37:54,171 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2168 transitions. Word has length 109 [2025-03-16 19:37:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:54,171 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2168 transitions. [2025-03-16 19:37:54,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2168 transitions. [2025-03-16 19:37:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:54,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:54,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:54,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:37:54,173 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:54,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash -47519931, now seen corresponding path program 1 times [2025-03-16 19:37:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:54,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770633232] [2025-03-16 19:37:54,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:54,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:54,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:54,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770633232] [2025-03-16 19:37:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770633232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329605368] [2025-03-16 19:37:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:54,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:54,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:54,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:54,345 INFO L87 Difference]: Start difference. First operand 1559 states and 2168 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:55,672 INFO L93 Difference]: Finished difference Result 2633 states and 3681 transitions. [2025-03-16 19:37:55,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:55,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:55,675 INFO L225 Difference]: With dead ends: 2633 [2025-03-16 19:37:55,675 INFO L226 Difference]: Without dead ends: 2403 [2025-03-16 19:37:55,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:55,676 INFO L435 NwaCegarLoop]: 1161 mSDtfsCounter, 3103 mSDsluCounter, 3816 mSDsCounter, 0 mSdLazyCounter, 4051 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3103 SdHoareTripleChecker+Valid, 4977 SdHoareTripleChecker+Invalid, 4055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:55,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3103 Valid, 4977 Invalid, 4055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4051 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-03-16 19:37:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 1555. [2025-03-16 19:37:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4174311926605505) internal successors, (2163), 1554 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2163 transitions. [2025-03-16 19:37:55,690 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2163 transitions. Word has length 110 [2025-03-16 19:37:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:55,690 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2163 transitions. [2025-03-16 19:37:55,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2163 transitions. [2025-03-16 19:37:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:37:55,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:55,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:55,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:37:55,692 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:55,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash -261375590, now seen corresponding path program 1 times [2025-03-16 19:37:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504616434] [2025-03-16 19:37:55,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:55,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:37:55,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:37:55,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:55,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:55,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504616434] [2025-03-16 19:37:55,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504616434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:55,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:55,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:55,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561801785] [2025-03-16 19:37:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:55,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:55,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:55,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:55,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:55,885 INFO L87 Difference]: Start difference. First operand 1555 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:57,168 INFO L93 Difference]: Finished difference Result 2563 states and 3583 transitions. [2025-03-16 19:37:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:57,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:37:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:57,170 INFO L225 Difference]: With dead ends: 2563 [2025-03-16 19:37:57,170 INFO L226 Difference]: Without dead ends: 2379 [2025-03-16 19:37:57,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:57,171 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 5052 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 3702 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5052 SdHoareTripleChecker+Valid, 4473 SdHoareTripleChecker+Invalid, 3706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:57,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5052 Valid, 4473 Invalid, 3706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3702 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-16 19:37:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1555. [2025-03-16 19:37:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.416775884665793) internal successors, (2162), 1554 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2162 transitions. [2025-03-16 19:37:57,184 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2162 transitions. Word has length 110 [2025-03-16 19:37:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:57,184 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2162 transitions. [2025-03-16 19:37:57,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2162 transitions. [2025-03-16 19:37:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:57,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:57,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:57,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:37:57,185 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:57,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1687772322, now seen corresponding path program 1 times [2025-03-16 19:37:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:57,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583739865] [2025-03-16 19:37:57,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:57,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:57,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:57,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:57,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:57,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:57,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-16 19:37:57,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583739865] [2025-03-16 19:37:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583739865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:57,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501322048] [2025-03-16 19:37:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:57,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:57,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:57,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:57,360 INFO L87 Difference]: Start difference. First operand 1555 states and 2162 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:58,542 INFO L93 Difference]: Finished difference Result 2521 states and 3504 transitions. [2025-03-16 19:37:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:58,544 INFO L225 Difference]: With dead ends: 2521 [2025-03-16 19:37:58,544 INFO L226 Difference]: Without dead ends: 2331 [2025-03-16 19:37:58,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:58,545 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 5435 mSDsluCounter, 2985 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5435 SdHoareTripleChecker+Valid, 3899 SdHoareTripleChecker+Invalid, 3334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:58,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5435 Valid, 3899 Invalid, 3334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3330 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2025-03-16 19:37:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 1555. [2025-03-16 19:37:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4154652686762779) internal successors, (2160), 1554 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2160 transitions. [2025-03-16 19:37:58,556 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2160 transitions. Word has length 111 [2025-03-16 19:37:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:58,556 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2160 transitions. [2025-03-16 19:37:58,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2160 transitions. [2025-03-16 19:37:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:58,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:58,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:58,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:37:58,558 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:58,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1541400316, now seen corresponding path program 1 times [2025-03-16 19:37:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004680454] [2025-03-16 19:37:58,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:58,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:58,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:58,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:58,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:58,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:58,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004680454] [2025-03-16 19:37:58,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004680454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:58,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:58,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:58,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944701805] [2025-03-16 19:37:58,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:58,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:58,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:58,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:58,746 INFO L87 Difference]: Start difference. First operand 1555 states and 2160 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:59,993 INFO L93 Difference]: Finished difference Result 2601 states and 3626 transitions. [2025-03-16 19:37:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:59,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:59,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:59,995 INFO L225 Difference]: With dead ends: 2601 [2025-03-16 19:37:59,995 INFO L226 Difference]: Without dead ends: 2379 [2025-03-16 19:37:59,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:59,996 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 5043 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 3694 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5043 SdHoareTripleChecker+Valid, 4473 SdHoareTripleChecker+Invalid, 3698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:59,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5043 Valid, 4473 Invalid, 3698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3694 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-03-16 19:38:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1555. [2025-03-16 19:38:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1526 states have (on average 1.4141546526867628) internal successors, (2158), 1554 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2158 transitions. [2025-03-16 19:38:00,010 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2158 transitions. Word has length 111 [2025-03-16 19:38:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:38:00,010 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2158 transitions. [2025-03-16 19:38:00,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:38:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2158 transitions. [2025-03-16 19:38:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:38:00,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:38:00,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:38:00,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:38:00,012 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:38:00,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:38:00,012 INFO L85 PathProgramCache]: Analyzing trace with hash -821248444, now seen corresponding path program 1 times [2025-03-16 19:38:00,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:38:00,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819576600] [2025-03-16 19:38:00,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:38:00,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:38:00,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:38:00,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:38:00,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:38:00,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:38:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:38:00,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:38:00,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819576600] [2025-03-16 19:38:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819576600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:38:00,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:38:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:38:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007299004] [2025-03-16 19:38:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:38:00,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:38:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:38:00,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:38:00,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:38:00,215 INFO L87 Difference]: Start difference. First operand 1555 states and 2158 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)