./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.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.BOUNDED-14.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 f8b90978b682a83c8f6f0d2fe75b83e30918fdef6451144e6a40fff2a4b9e706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:36:32,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:36:32,937 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:32,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:36:32,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:36:32,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:36:32,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:36:32,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:36:32,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:36:32,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:36:32,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:36:32,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:36:32,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:36:32,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:36:32,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:36:32,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:36:32,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:36:32,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:36:32,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:36:32,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:36:32,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:36:32,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:36:32,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:32,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:36:32,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:36:32,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:36:32,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:36:32,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:36:32,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:36:32,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:36:32,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:36:32,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:36:32,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:36:32,973 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 -> f8b90978b682a83c8f6f0d2fe75b83e30918fdef6451144e6a40fff2a4b9e706 [2025-03-16 19:36:33,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:36:33,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:36:33,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:36:33,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:36:33,229 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:36:33,231 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.BOUNDED-14.pals.c.v+sep-reducer.c [2025-03-16 19:36:34,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabd4f16d/194c9824ec804f0f8b73cdfb8c66c5ac/FLAG515d07c2e [2025-03-16 19:36:35,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:36:35,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2025-03-16 19:36:35,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabd4f16d/194c9824ec804f0f8b73cdfb8c66c5ac/FLAG515d07c2e [2025-03-16 19:36:35,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cabd4f16d/194c9824ec804f0f8b73cdfb8c66c5ac [2025-03-16 19:36:35,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:36:35,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:36:35,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:35,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:36:35,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:36:35,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:35" (1/1) ... [2025-03-16 19:36:35,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cdb9298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:35, skipping insertion in model container [2025-03-16 19:36:35,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:35" (1/1) ... [2025-03-16 19:36:35,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:36:36,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[172160,172173] [2025-03-16 19:36:36,571 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[250199,250212] [2025-03-16 19:36:36,633 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[289422,289435] [2025-03-16 19:36:36,664 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[309133,309146] [2025-03-16 19:36:36,681 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[319011,319024] [2025-03-16 19:36:36,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.BOUNDED-14.pals.c.v+sep-reducer.c[323922,323935] [2025-03-16 19:36:36,697 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[328750,328763] [2025-03-16 19:36:36,813 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[405185,405198] [2025-03-16 19:36:36,870 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[443553,443566] [2025-03-16 19:36:36,899 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[463065,463078] [2025-03-16 19:36:36,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[472989,473002] [2025-03-16 19:36:36,923 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[477943,477956] [2025-03-16 19:36:36,932 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[482814,482827] [2025-03-16 19:36:36,988 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[521320,521333] [2025-03-16 19:36:37,018 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[540838,540851] [2025-03-16 19:36:37,036 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[550762,550775] [2025-03-16 19:36:37,045 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[555716,555729] [2025-03-16 19:36:37,056 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[560575,560588] [2025-03-16 19:36:37,095 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[581321,581334] [2025-03-16 19:36:37,112 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[591188,591201] [2025-03-16 19:36:37,121 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[596115,596128] [2025-03-16 19:36:37,130 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[600957,600970] [2025-03-16 19:36:37,140 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[606379,606392] [2025-03-16 19:36:37,148 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[611215,611228] [2025-03-16 19:36:37,156 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[616142,616155] [2025-03-16 19:36:37,164 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[620984,620997] [2025-03-16 19:36:37,173 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[626027,626040] [2025-03-16 19:36:37,182 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[631036,631049] [2025-03-16 19:36:37,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.BOUNDED-14.pals.c.v+sep-reducer.c[635974,635987] [2025-03-16 19:36:37,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:37,282 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:36:37,553 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[172160,172173] [2025-03-16 19:36:37,657 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[250199,250212] [2025-03-16 19:36:37,708 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[289422,289435] [2025-03-16 19:36:37,736 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[309133,309146] [2025-03-16 19:36:37,753 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[319011,319024] [2025-03-16 19:36:37,760 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[323922,323935] [2025-03-16 19:36:37,769 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[328750,328763] [2025-03-16 19:36:37,869 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[405185,405198] [2025-03-16 19:36:37,920 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[443553,443566] [2025-03-16 19:36:37,947 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[463065,463078] [2025-03-16 19:36:37,961 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[472989,473002] [2025-03-16 19:36:37,968 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[477943,477956] [2025-03-16 19:36:37,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[482814,482827] [2025-03-16 19:36:38,072 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[521320,521333] [2025-03-16 19:36:38,096 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[540838,540851] [2025-03-16 19:36:38,109 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[550762,550775] [2025-03-16 19:36:38,116 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[555716,555729] [2025-03-16 19:36:38,123 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[560575,560588] [2025-03-16 19:36:38,151 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[581321,581334] [2025-03-16 19:36:38,164 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[591188,591201] [2025-03-16 19:36:38,170 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[596115,596128] [2025-03-16 19:36:38,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[600957,600970] [2025-03-16 19:36:38,184 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[606379,606392] [2025-03-16 19:36:38,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.BOUNDED-14.pals.c.v+sep-reducer.c[611215,611228] [2025-03-16 19:36:38,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[616142,616155] [2025-03-16 19:36:38,203 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[620984,620997] [2025-03-16 19:36:38,210 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[626027,626040] [2025-03-16 19:36:38,216 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[631036,631049] [2025-03-16 19:36:38,223 WARN L250 ndardFunctionHandler]: Function reach_error is 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.BOUNDED-14.pals.c.v+sep-reducer.c[635974,635987] [2025-03-16 19:36:38,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:38,289 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:36:38,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:38 WrapperNode [2025-03-16 19:36:38,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:38,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:38,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:36:38,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:36:38,296 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:38" (1/1) ... [2025-03-16 19:36:38,369 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:38" (1/1) ... [2025-03-16 19:36:38,731 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28257 [2025-03-16 19:36:38,732 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:38,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:36:38,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:36:38,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:36:38,739 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:38" (1/1) ... [2025-03-16 19:36:38,740 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:38" (1/1) ... [2025-03-16 19:36:38,790 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:38" (1/1) ... [2025-03-16 19:36:38,886 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:38,887 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:38" (1/1) ... [2025-03-16 19:36:38,887 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:38" (1/1) ... [2025-03-16 19:36:38,978 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:38" (1/1) ... [2025-03-16 19:36:38,998 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:38" (1/1) ... [2025-03-16 19:36:39,024 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:38" (1/1) ... [2025-03-16 19:36:39,050 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:38" (1/1) ... [2025-03-16 19:36:39,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:36:39,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:36:39,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:36:39,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:36:39,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:38" (1/1) ... [2025-03-16 19:36:39,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:39,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:36:39,138 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:39,141 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:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:36:39,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:36:39,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:36:39,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:36:39,669 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:36:39,671 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:36:48,256 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21112: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~83#1; [2025-03-16 19:36:48,256 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20588: 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_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~67#1; [2025-03-16 19:36:48,256 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22704: 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_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~78#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30105: 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_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~108#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21649: 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_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~72#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8438: 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_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29580: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~100#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29052: 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_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~103#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8969: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~32#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46499: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28001: 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_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~98#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9506: 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_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-03-16 19:36:48,257 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L27481: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~110#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11097: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~35#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29597: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~119#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10572: 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_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~28#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25904: 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_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~91#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25379: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~85#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24851: 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_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~88#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26966: 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_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~95#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713: 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_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2657: 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_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:36:48,258 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11114: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~41#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46527: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11651: 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_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~32#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25396: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~101#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40724: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~119#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~8#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40741: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~126#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46555: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13797: 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_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~41#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12741: 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_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~38#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40758: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~140#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38655: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~158#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13287: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~50#1; [2025-03-16 19:36:48,259 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46583: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5888: 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_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44999: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~155#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5361: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~15#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4833: 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_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15404: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~45#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14876: 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_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~44#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40775: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~167#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40247: 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_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~157#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39195: 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_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~151#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34442: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~140#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36559: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~125#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1148: 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_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38144: 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_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~146#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15948: 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_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~48#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23876: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~65#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L45016: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~185#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5378: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~17#1; [2025-03-16 19:36:48,260 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15421: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~50#1; [2025-03-16 19:36:48,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42908: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~176#1; [2025-03-16 19:36:48,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34983: 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_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~132#1; [2025-03-16 19:36:48,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17543: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~68#1; [2025-03-16 19:36:48,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37099: 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_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~140#1; [2025-03-16 19:36:48,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32344: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~99#1; [2025-03-16 19:36:48,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17018: 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_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~52#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36576: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~149#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23893: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~66#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L45562: 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_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~187#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15438: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~59#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43449: 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_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~175#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36051: 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_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~136#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18083: 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_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc main_~node7____CPAchecker_TMP_0~1#1;havoc main_~node7__m7~2#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32361: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~110#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19681: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~65#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23910: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~68#1; [2025-03-16 19:36:48,262 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19156: 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_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33957: 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_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~126#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44528: 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_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~181#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8060: 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_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32901: 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_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~120#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7004: 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_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21804: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~86#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21279: 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_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~71#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32378: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~131#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23394: 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_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~82#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31853: 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_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~115#1; [2025-03-16 19:36:48,263 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42423: 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_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~169#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19698: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~77#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41367: 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_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~163#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23927: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~72#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22344: 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_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~76#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30802: 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_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~110#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28159: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~95#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7550: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~26#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20235: 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_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9667: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~27#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9139: 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_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30282: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~122#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28699: 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_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~101#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23944: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~80#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278: 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_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28176: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~113#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L27651: 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_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~97#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10211: 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_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~27#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29767: 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_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~107#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9684: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~30#1; [2025-03-16 19:36:48,264 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26601: 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_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~93#1; [2025-03-16 19:36:48,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24488: 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_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~87#1; [2025-03-16 19:36:48,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23961: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~95#1; [2025-03-16 19:36:48,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11806: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~44#1; [2025-03-16 19:36:48,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11281: 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_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~31#1; [2025-03-16 19:36:48,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26081: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~104#1; [2025-03-16 19:36:48,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9701: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~35#1; [2025-03-16 19:36:48,265 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12346: 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_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~36#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25566: 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_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~90#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3376: 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_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3907: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~9#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3924: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~10#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39341: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~135#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4468: 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_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3941: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~11#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L45695: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~188#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14515: 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_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~43#1; [2025-03-16 19:36:48,266 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35128: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~99#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13988: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~45#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13460: 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_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~40#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39358: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~161#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43588: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~135#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37254: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~152#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39898: 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_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~155#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35145: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~102#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46244: havoc main_~node1__m1~129#1;havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~192#1;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_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~191#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5548: 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_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-16 19:36:48,267 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14005: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~53#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18234: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~51#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6079: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~20#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43605: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~150#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37794: 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_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~144#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38853: 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_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~149#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6616: 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_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36743: 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_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~139#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35162: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~108#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15608: 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_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~47#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18251: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~54#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43622: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~179#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16139: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~62#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40982: 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_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~161#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33056: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~134#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22489: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~75#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16676: 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_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~50#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35704: 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_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~135#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34648: 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_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~130#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35179: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~120#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46278: havoc main_~node2__m2~130#1; [2025-03-16 19:36:48,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18795: 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_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~60#1; [2025-03-16 19:36:48,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41522: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~170#1; [2025-03-16 19:36:48,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18268: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~60#1; [2025-03-16 19:36:48,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33596: 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_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~124#1; [2025-03-16 19:36:48,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17741: 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_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~55#1; [2025-03-16 19:36:48,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43114: 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_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~173#1; [2025-03-16 19:36:48,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32545: 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_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~119#1; [2025-03-16 19:36:48,269 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20390: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~80#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30960: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~105#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22506: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~89#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42062: 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_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~167#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L45233: havoc main_~main____CPAchecker_TMP_0~125#1;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_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~185#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19865: 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_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44179: 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_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~179#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28854: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~116#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35196: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~143#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18285: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~71#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20930: 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_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~69#1; [2025-03-16 19:36:48,270 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31500: 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_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~113#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23046: 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_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~80#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8778: 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_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8251: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~25#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30977: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~125#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7723: 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_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29394: 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_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~105#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L30452: 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_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~109#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46310: havoc main_~node3__m3~132#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28343: 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_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~100#1; [2025-03-16 19:36:48,271 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22002: 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_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~74#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: 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_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26762: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~81#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8268: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~29#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12500: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~33#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L27304: 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_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~96#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24134: 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_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~86#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~5#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26779: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~90#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26251: 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_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~92#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9871: 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_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~26#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10402: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~38#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46342: havoc main_~node4__m4~136#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12517: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~34#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L890: 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:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L25205: 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_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~89#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L24678: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~98#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3011: 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_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10939: 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_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~29#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2484: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~5#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L26796: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~107#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12004: 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_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1; [2025-03-16 19:36:48,272 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12534: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~36#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46374: havoc main_~node5__m5~144#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12551: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L924: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40041: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~164#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13095: 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_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~39#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12568: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~47#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5170: 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_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-03-16 19:36:48,273 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L40582: 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_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~159#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4114: 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_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37943: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~117#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L958: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4660: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~14#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14175: 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_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~42#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37960: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~130#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6249: 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_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14706: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~56#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6780: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~17#1; [2025-03-16 19:36:48,274 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15243: 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_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~45#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1502: 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_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L39556: 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_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~153#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33742: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~115#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L38500: 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_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~147#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L975: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16834: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~55#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37977: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~155#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16309: 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_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~49#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L45906: 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_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~189#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44322: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~182#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6797: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-16 19:36:48,275 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L37452: 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_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~142#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42208: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~145#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L36401: 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_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~137#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46443: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~160#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23188: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~92#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33759: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~137#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L992: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21078: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~63#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16851: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~65#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L44863: 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_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~183#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35881: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~146#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6814: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~20#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42225: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~173#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31655: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~128#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L23728: 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_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~84#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L34299: 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_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~128#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17388: 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_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~53#1; [2025-03-16 19:36:48,276 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29546: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~85#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L21095: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~70#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L42765: 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_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~171#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L35366: 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_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~134#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L32195: 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_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~117#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18455: 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_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L33254: 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_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~122#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7358: 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_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18986: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~74#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~23#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L46471: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L31144: 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_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~112#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L29563: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~90#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L43834: 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_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~177#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19523: 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_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~62#1; [2025-03-16 19:36:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L41720: 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_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~165#1; [2025-03-16 19:36:49,512 INFO L? ?]: Removed 5967 outVars from TransFormulas that were not future-live. [2025-03-16 19:36:49,512 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:36:49,593 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:36:49,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:36:49,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:36:49 BoogieIcfgContainer [2025-03-16 19:36:49,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:36:49,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:36:49,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:36:49,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:36:49,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:36:35" (1/3) ... [2025-03-16 19:36:49,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c763876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:36:49, skipping insertion in model container [2025-03-16 19:36:49,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:38" (2/3) ... [2025-03-16 19:36:49,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c763876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:36:49, skipping insertion in model container [2025-03-16 19:36:49,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:36:49" (3/3) ... [2025-03-16 19:36:49,604 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2025-03-16 19:36:49,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:36:49,620 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c that has 1 procedures, 5466 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-16 19:36:49,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:36:49,799 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;@776cb3cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:36:49,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-16 19:36:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 5466 states, 5436 states have (on average 1.7492641648270788) internal successors, (9509), 5465 states have internal predecessors, (9509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:36:49,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:49,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:49,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:49,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1070754300, now seen corresponding path program 1 times [2025-03-16 19:36:49,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:49,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092132104] [2025-03-16 19:36:49,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:50,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:36:50,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:36:50,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:50,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092132104] [2025-03-16 19:36:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092132104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:50,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:50,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749754874] [2025-03-16 19:36:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:50,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:50,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:50,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:50,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:50,684 INFO L87 Difference]: Start difference. First operand has 5466 states, 5436 states have (on average 1.7492641648270788) internal successors, (9509), 5465 states have internal predecessors, (9509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:53,578 INFO L93 Difference]: Finished difference Result 6607 states and 11351 transitions. [2025-03-16 19:36:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:53,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:36:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:53,604 INFO L225 Difference]: With dead ends: 6607 [2025-03-16 19:36:53,605 INFO L226 Difference]: Without dead ends: 3907 [2025-03-16 19:36:53,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:36:53,615 INFO L435 NwaCegarLoop]: 3583 mSDtfsCounter, 19818 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19818 SdHoareTripleChecker+Valid, 3629 SdHoareTripleChecker+Invalid, 3113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:53,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19818 Valid, 3629 Invalid, 3113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 19:36:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2025-03-16 19:36:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3907. [2025-03-16 19:36:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3907 states, 3878 states have (on average 1.3045384218669418) internal successors, (5059), 3906 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 5059 transitions. [2025-03-16 19:36:53,754 INFO L78 Accepts]: Start accepts. Automaton has 3907 states and 5059 transitions. Word has length 101 [2025-03-16 19:36:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:53,755 INFO L471 AbstractCegarLoop]: Abstraction has 3907 states and 5059 transitions. [2025-03-16 19:36:53,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 5059 transitions. [2025-03-16 19:36:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:36:53,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:53,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:53,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:36:53,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:53,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1517218047, now seen corresponding path program 1 times [2025-03-16 19:36:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:53,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342703657] [2025-03-16 19:36:53,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:53,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:36:53,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:36:53,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:53,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:54,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342703657] [2025-03-16 19:36:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342703657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:54,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:54,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029486892] [2025-03-16 19:36:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:54,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:54,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:54,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:54,060 INFO L87 Difference]: Start difference. First operand 3907 states and 5059 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:55,562 INFO L93 Difference]: Finished difference Result 4463 states and 5746 transitions. [2025-03-16 19:36:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:36:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:55,570 INFO L225 Difference]: With dead ends: 4463 [2025-03-16 19:36:55,570 INFO L226 Difference]: Without dead ends: 2571 [2025-03-16 19:36:55,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:55,572 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 9928 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9928 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:55,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9928 Valid, 1639 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:36:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2025-03-16 19:36:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2571. [2025-03-16 19:36:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2542 states have (on average 1.3194335169158142) internal successors, (3354), 2570 states have internal predecessors, (3354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3354 transitions. [2025-03-16 19:36:55,603 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3354 transitions. Word has length 101 [2025-03-16 19:36:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:55,604 INFO L471 AbstractCegarLoop]: Abstraction has 2571 states and 3354 transitions. [2025-03-16 19:36:55,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3354 transitions. [2025-03-16 19:36:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:36:55,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:55,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:55,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:36:55,609 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:36:55,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:55,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1712843118, now seen corresponding path program 1 times [2025-03-16 19:36:55,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692647884] [2025-03-16 19:36:55,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:55,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:36:55,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:36:55,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:55,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:55,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692647884] [2025-03-16 19:36:55,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692647884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:55,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:55,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142142843] [2025-03-16 19:36:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:55,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:55,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:55,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:55,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:55,833 INFO L87 Difference]: Start difference. First operand 2571 states and 3354 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:56,787 INFO L93 Difference]: Finished difference Result 3319 states and 4328 transitions. [2025-03-16 19:36:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-16 19:36:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:56,794 INFO L225 Difference]: With dead ends: 3319 [2025-03-16 19:36:56,794 INFO L226 Difference]: Without dead ends: 2035 [2025-03-16 19:36:56,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:56,798 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 7935 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7935 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:56,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7935 Valid, 1383 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:36:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2025-03-16 19:36:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2035. [2025-03-16 19:36:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2006 states have (on average 1.3364905284147557) internal successors, (2681), 2034 states have internal predecessors, (2681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2681 transitions. [2025-03-16 19:36:56,825 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2681 transitions. Word has length 101 [2025-03-16 19:36:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:56,825 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 2681 transitions. [2025-03-16 19:36:56,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2681 transitions. [2025-03-16 19:36:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:36:56,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:56,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:56,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:36:56,829 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:36:56,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash -503113576, now seen corresponding path program 1 times [2025-03-16 19:36:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577573065] [2025-03-16 19:36:56,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:56,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:36:56,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:36:56,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:56,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577573065] [2025-03-16 19:36:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577573065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29633432] [2025-03-16 19:36:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:57,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:57,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:57,078 INFO L87 Difference]: Start difference. First operand 2035 states and 2681 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:57,685 INFO L93 Difference]: Finished difference Result 2294 states and 2973 transitions. [2025-03-16 19:36:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:57,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-16 19:36:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:57,689 INFO L225 Difference]: With dead ends: 2294 [2025-03-16 19:36:57,689 INFO L226 Difference]: Without dead ends: 1346 [2025-03-16 19:36:57,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:57,691 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 5182 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5182 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:57,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5182 Valid, 960 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:36:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-03-16 19:36:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1346. [2025-03-16 19:36:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1317 states have (on average 1.3485193621867881) internal successors, (1776), 1345 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:57,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1776 transitions. [2025-03-16 19:36:57,709 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1776 transitions. Word has length 103 [2025-03-16 19:36:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:57,710 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1776 transitions. [2025-03-16 19:36:57,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1776 transitions. [2025-03-16 19:36:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:36:57,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:57,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:57,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:36:57,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1193214908, now seen corresponding path program 1 times [2025-03-16 19:36:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021263088] [2025-03-16 19:36:57,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:57,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:57,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:36:57,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:36:57,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:57,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:57,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021263088] [2025-03-16 19:36:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021263088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040388334] [2025-03-16 19:36:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:57,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:57,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:57,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:57,949 INFO L87 Difference]: Start difference. First operand 1346 states and 1776 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:58,549 INFO L93 Difference]: Finished difference Result 1974 states and 2616 transitions. [2025-03-16 19:36:58,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:58,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-16 19:36:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:58,552 INFO L225 Difference]: With dead ends: 1974 [2025-03-16 19:36:58,553 INFO L226 Difference]: Without dead ends: 1248 [2025-03-16 19:36:58,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:58,554 INFO L435 NwaCegarLoop]: 957 mSDtfsCounter, 4910 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4910 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:58,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4910 Valid, 969 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:36:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2025-03-16 19:36:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2025-03-16 19:36:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1219 states have (on average 1.3625922887612798) internal successors, (1661), 1247 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1661 transitions. [2025-03-16 19:36:58,567 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1661 transitions. Word has length 105 [2025-03-16 19:36:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:58,567 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1661 transitions. [2025-03-16 19:36:58,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:58,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1661 transitions. [2025-03-16 19:36:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:36:58,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:58,570 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:36:58,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:36:58,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:58,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1619318025, now seen corresponding path program 1 times [2025-03-16 19:36:58,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:58,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454660469] [2025-03-16 19:36:58,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:58,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:58,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:36:58,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:36:58,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:58,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:58,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:58,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454660469] [2025-03-16 19:36:58,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454660469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:58,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:58,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012015480] [2025-03-16 19:36:58,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:58,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:58,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:58,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:58,754 INFO L87 Difference]: Start difference. First operand 1248 states and 1661 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:59,568 INFO L93 Difference]: Finished difference Result 2532 states and 3387 transitions. [2025-03-16 19:36:59,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:59,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 19:36:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:59,572 INFO L225 Difference]: With dead ends: 2532 [2025-03-16 19:36:59,572 INFO L226 Difference]: Without dead ends: 1853 [2025-03-16 19:36:59,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:59,574 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 6508 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6508 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:59,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6508 Valid, 1451 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:36:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2025-03-16 19:36:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1741. [2025-03-16 19:36:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1712 states have (on average 1.3942757009345794) internal successors, (2387), 1740 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2387 transitions. [2025-03-16 19:36:59,596 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2387 transitions. Word has length 107 [2025-03-16 19:36:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:59,596 INFO L471 AbstractCegarLoop]: Abstraction has 1741 states and 2387 transitions. [2025-03-16 19:36:59,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2387 transitions. [2025-03-16 19:36:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:59,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:59,598 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:36:59,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:36:59,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:59,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2111931357, now seen corresponding path program 1 times [2025-03-16 19:36:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412582049] [2025-03-16 19:36:59,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:59,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:59,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:59,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:59,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:59,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:59,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:59,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412582049] [2025-03-16 19:36:59,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412582049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:59,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:59,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:59,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809859984] [2025-03-16 19:36:59,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:59,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:59,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:59,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:59,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:59,769 INFO L87 Difference]: Start difference. First operand 1741 states and 2387 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 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:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:00,415 INFO L93 Difference]: Finished difference Result 2471 states and 3379 transitions. [2025-03-16 19:37:00,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:37:00,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 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:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:00,419 INFO L225 Difference]: With dead ends: 2471 [2025-03-16 19:37:00,419 INFO L226 Difference]: Without dead ends: 1733 [2025-03-16 19:37:00,420 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:00,421 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 4619 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4619 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:00,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4619 Valid, 769 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:37:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-03-16 19:37:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1733. [2025-03-16 19:37:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3943661971830985) internal successors, (2376), 1732 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states 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,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2376 transitions. [2025-03-16 19:37:00,443 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2376 transitions. Word has length 109 [2025-03-16 19:37:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:00,443 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2376 transitions. [2025-03-16 19:37:00,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 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:00,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2376 transitions. [2025-03-16 19:37:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:00,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:00,446 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:00,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:37:00,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:00,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:00,447 INFO L85 PathProgramCache]: Analyzing trace with hash 182368965, now seen corresponding path program 1 times [2025-03-16 19:37:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709451319] [2025-03-16 19:37:00,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:00,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:00,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:00,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:00,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:01,233 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,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:01,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709451319] [2025-03-16 19:37:01,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709451319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:01,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:01,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984545464] [2025-03-16 19:37:01,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:01,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:01,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:01,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:01,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:01,234 INFO L87 Difference]: Start difference. First operand 1733 states and 2376 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:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:02,596 INFO L93 Difference]: Finished difference Result 2803 states and 3838 transitions. [2025-03-16 19:37:02,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:02,596 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:02,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:02,602 INFO L225 Difference]: With dead ends: 2803 [2025-03-16 19:37:02,602 INFO L226 Difference]: Without dead ends: 2384 [2025-03-16 19:37:02,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:02,603 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 6581 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 3018 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6581 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:02,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6581 Valid, 4129 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3018 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2025-03-16 19:37:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1733. [2025-03-16 19:37:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3937793427230047) internal successors, (2375), 1732 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states 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:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2375 transitions. [2025-03-16 19:37:02,630 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2375 transitions. Word has length 111 [2025-03-16 19:37:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:02,630 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2375 transitions. [2025-03-16 19:37:02,630 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:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2375 transitions. [2025-03-16 19:37:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:02,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:02,633 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:02,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:37:02,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:02,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:02,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1608232167, now seen corresponding path program 1 times [2025-03-16 19:37:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:02,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176167735] [2025-03-16 19:37:02,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:02,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:02,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:02,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:02,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:03,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:03,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176167735] [2025-03-16 19:37:03,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176167735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:03,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:03,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763142247] [2025-03-16 19:37:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:03,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:03,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:03,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:03,100 INFO L87 Difference]: Start difference. First operand 1733 states and 2375 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:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:04,504 INFO L93 Difference]: Finished difference Result 2986 states and 4119 transitions. [2025-03-16 19:37:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:04,504 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:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:04,510 INFO L225 Difference]: With dead ends: 2986 [2025-03-16 19:37:04,510 INFO L226 Difference]: Without dead ends: 2703 [2025-03-16 19:37:04,511 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:04,511 INFO L435 NwaCegarLoop]: 1130 mSDtfsCounter, 5889 mSDsluCounter, 3806 mSDsCounter, 0 mSdLazyCounter, 3560 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5889 SdHoareTripleChecker+Valid, 4936 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:04,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5889 Valid, 4936 Invalid, 3564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3560 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2025-03-16 19:37:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1733. [2025-03-16 19:37:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3931924882629108) internal successors, (2374), 1732 states have internal predecessors, (2374), 0 states have call successors, (0), 0 states 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,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2374 transitions. [2025-03-16 19:37:04,534 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2374 transitions. Word has length 111 [2025-03-16 19:37:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:04,534 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2374 transitions. [2025-03-16 19:37:04,535 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:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2374 transitions. [2025-03-16 19:37:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:04,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:04,537 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:04,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:37:04,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -478167769, now seen corresponding path program 1 times [2025-03-16 19:37:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:04,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473905117] [2025-03-16 19:37:04,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:04,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:04,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:04,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:04,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:04,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:04,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473905117] [2025-03-16 19:37:04,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473905117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:04,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:04,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:37:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460920973] [2025-03-16 19:37:04,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:04,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:37:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:04,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:37:04,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:37:04,949 INFO L87 Difference]: Start difference. First operand 1733 states and 2374 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 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:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:06,179 INFO L93 Difference]: Finished difference Result 3006 states and 3984 transitions. [2025-03-16 19:37:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:37:06,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 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:06,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:06,184 INFO L225 Difference]: With dead ends: 3006 [2025-03-16 19:37:06,184 INFO L226 Difference]: Without dead ends: 2275 [2025-03-16 19:37:06,185 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:06,185 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 5333 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 2812 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5333 SdHoareTripleChecker+Valid, 2632 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:06,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5333 Valid, 2632 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2812 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2025-03-16 19:37:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 1733. [2025-03-16 19:37:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.392605633802817) internal successors, (2373), 1732 states have internal predecessors, (2373), 0 states have call successors, (0), 0 states 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:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2373 transitions. [2025-03-16 19:37:06,202 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2373 transitions. Word has length 111 [2025-03-16 19:37:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:06,202 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2373 transitions. [2025-03-16 19:37:06,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 6 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:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2373 transitions. [2025-03-16 19:37:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:06,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:06,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:06,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:37:06,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:06,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:06,206 INFO L85 PathProgramCache]: Analyzing trace with hash -168156278, now seen corresponding path program 1 times [2025-03-16 19:37:06,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:06,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098668768] [2025-03-16 19:37:06,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:06,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:06,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:06,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:06,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:06,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:06,513 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,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:06,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098668768] [2025-03-16 19:37:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098668768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:06,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:06,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:06,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181482044] [2025-03-16 19:37:06,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:06,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:06,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:06,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:06,515 INFO L87 Difference]: Start difference. First operand 1733 states and 2373 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:07,718 INFO L93 Difference]: Finished difference Result 2842 states and 3899 transitions. [2025-03-16 19:37:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:07,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:37:07,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:07,724 INFO L225 Difference]: With dead ends: 2842 [2025-03-16 19:37:07,724 INFO L226 Difference]: Without dead ends: 2648 [2025-03-16 19:37:07,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:07,725 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 4169 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 2987 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4169 SdHoareTripleChecker+Valid, 4023 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:07,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4169 Valid, 4023 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2987 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-03-16 19:37:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1733. [2025-03-16 19:37:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.392018779342723) internal successors, (2372), 1732 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states 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,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2372 transitions. [2025-03-16 19:37:07,744 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2372 transitions. Word has length 112 [2025-03-16 19:37:07,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:07,744 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2372 transitions. [2025-03-16 19:37:07,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2372 transitions. [2025-03-16 19:37:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:07,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:07,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:07,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:37:07,746 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:07,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 13227059, now seen corresponding path program 1 times [2025-03-16 19:37:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757402838] [2025-03-16 19:37:07,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:07,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:07,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:07,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:07,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:08,071 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,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:08,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757402838] [2025-03-16 19:37:08,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757402838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:08,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:08,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772985575] [2025-03-16 19:37:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:08,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:08,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:08,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:08,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:08,073 INFO L87 Difference]: Start difference. First operand 1733 states and 2372 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:08,977 INFO L93 Difference]: Finished difference Result 2537 states and 3489 transitions. [2025-03-16 19:37:08,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:08,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:08,981 INFO L225 Difference]: With dead ends: 2537 [2025-03-16 19:37:08,981 INFO L226 Difference]: Without dead ends: 1823 [2025-03-16 19:37:08,982 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:08,983 INFO L435 NwaCegarLoop]: 1231 mSDtfsCounter, 2555 mSDsluCounter, 3200 mSDsCounter, 0 mSdLazyCounter, 2700 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2555 SdHoareTripleChecker+Valid, 4431 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:08,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2555 Valid, 4431 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2700 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:37:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2025-03-16 19:37:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1733. [2025-03-16 19:37:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3908450704225352) internal successors, (2370), 1732 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states 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,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2370 transitions. [2025-03-16 19:37:09,038 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2370 transitions. Word has length 113 [2025-03-16 19:37:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:09,038 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2370 transitions. [2025-03-16 19:37:09,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2370 transitions. [2025-03-16 19:37:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:09,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:09,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:09,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:37:09,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:09,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:09,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1828624243, now seen corresponding path program 1 times [2025-03-16 19:37:09,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:09,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243206593] [2025-03-16 19:37:09,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:09,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:09,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:09,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:09,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:09,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:09,633 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,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:09,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243206593] [2025-03-16 19:37:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243206593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:09,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879670538] [2025-03-16 19:37:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:09,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:09,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:09,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:09,636 INFO L87 Difference]: Start difference. First operand 1733 states and 2370 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:10,989 INFO L93 Difference]: Finished difference Result 2951 states and 4055 transitions. [2025-03-16 19:37:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:10,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:10,995 INFO L225 Difference]: With dead ends: 2951 [2025-03-16 19:37:10,995 INFO L226 Difference]: Without dead ends: 2672 [2025-03-16 19:37:10,996 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:10,996 INFO L435 NwaCegarLoop]: 1080 mSDtfsCounter, 4855 mSDsluCounter, 4426 mSDsCounter, 0 mSdLazyCounter, 3907 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4855 SdHoareTripleChecker+Valid, 5506 SdHoareTripleChecker+Invalid, 3911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:10,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4855 Valid, 5506 Invalid, 3911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3907 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2025-03-16 19:37:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1733. [2025-03-16 19:37:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3896713615023475) internal successors, (2368), 1732 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2368 transitions. [2025-03-16 19:37:11,014 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2368 transitions. Word has length 113 [2025-03-16 19:37:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:11,014 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2368 transitions. [2025-03-16 19:37:11,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2368 transitions. [2025-03-16 19:37:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:11,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:11,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:11,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:37:11,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:11,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:11,016 INFO L85 PathProgramCache]: Analyzing trace with hash 616855219, now seen corresponding path program 1 times [2025-03-16 19:37:11,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:11,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345525298] [2025-03-16 19:37:11,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:11,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:11,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:11,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:11,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:11,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345525298] [2025-03-16 19:37:11,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345525298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:11,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:11,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:11,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069719651] [2025-03-16 19:37:11,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:11,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:11,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:11,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:11,376 INFO L87 Difference]: Start difference. First operand 1733 states and 2368 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:12,995 INFO L93 Difference]: Finished difference Result 3102 states and 4266 transitions. [2025-03-16 19:37:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:12,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:12,999 INFO L225 Difference]: With dead ends: 3102 [2025-03-16 19:37:13,000 INFO L226 Difference]: Without dead ends: 2703 [2025-03-16 19:37:13,000 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:13,001 INFO L435 NwaCegarLoop]: 1750 mSDtfsCounter, 4827 mSDsluCounter, 5714 mSDsCounter, 0 mSdLazyCounter, 4681 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4827 SdHoareTripleChecker+Valid, 7464 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:13,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4827 Valid, 7464 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:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2025-03-16 19:37:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1733. [2025-03-16 19:37:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3884976525821595) internal successors, (2366), 1732 states have internal predecessors, (2366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2366 transitions. [2025-03-16 19:37:13,042 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2366 transitions. Word has length 113 [2025-03-16 19:37:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:13,042 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2366 transitions. [2025-03-16 19:37:13,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2366 transitions. [2025-03-16 19:37:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:13,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:13,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:13,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:37:13,044 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:13,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:13,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2116783169, now seen corresponding path program 1 times [2025-03-16 19:37:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:13,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175938530] [2025-03-16 19:37:13,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:13,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:13,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:13,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:13,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:13,321 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:13,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:13,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175938530] [2025-03-16 19:37:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175938530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:13,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:13,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711615787] [2025-03-16 19:37:13,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:13,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:13,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:13,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:13,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:13,322 INFO L87 Difference]: Start difference. First operand 1733 states and 2366 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:14,704 INFO L93 Difference]: Finished difference Result 3007 states and 4131 transitions. [2025-03-16 19:37:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:14,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:14,709 INFO L225 Difference]: With dead ends: 3007 [2025-03-16 19:37:14,709 INFO L226 Difference]: Without dead ends: 2703 [2025-03-16 19:37:14,710 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:14,710 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 4896 mSDsluCounter, 4655 mSDsCounter, 0 mSdLazyCounter, 4333 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4896 SdHoareTripleChecker+Valid, 6070 SdHoareTripleChecker+Invalid, 4336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:14,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4896 Valid, 6070 Invalid, 4336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4333 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2025-03-16 19:37:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1733. [2025-03-16 19:37:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3879107981220657) internal successors, (2365), 1732 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states 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,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2365 transitions. [2025-03-16 19:37:14,727 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2365 transitions. Word has length 113 [2025-03-16 19:37:14,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:14,728 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2365 transitions. [2025-03-16 19:37:14,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2365 transitions. [2025-03-16 19:37:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:14,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:14,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:14,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:37:14,730 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:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -932672861, now seen corresponding path program 1 times [2025-03-16 19:37:14,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:14,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252943578] [2025-03-16 19:37:14,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:14,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:14,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:14,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:14,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252943578] [2025-03-16 19:37:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252943578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:15,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:15,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:15,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051815769] [2025-03-16 19:37:15,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:15,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:15,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:15,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:15,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:15,130 INFO L87 Difference]: Start difference. First operand 1733 states and 2365 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:16,328 INFO L93 Difference]: Finished difference Result 2784 states and 3791 transitions. [2025-03-16 19:37:16,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:16,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:16,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:16,334 INFO L225 Difference]: With dead ends: 2784 [2025-03-16 19:37:16,334 INFO L226 Difference]: Without dead ends: 2600 [2025-03-16 19:37:16,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:16,336 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 4210 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 3001 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 3951 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:16,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4210 Valid, 3951 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3001 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2025-03-16 19:37:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 1733. [2025-03-16 19:37:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3873239436619718) internal successors, (2364), 1732 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states 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:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2364 transitions. [2025-03-16 19:37:16,358 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2364 transitions. Word has length 113 [2025-03-16 19:37:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:16,358 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2364 transitions. [2025-03-16 19:37:16,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2364 transitions. [2025-03-16 19:37:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:16,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:16,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:16,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:37:16,361 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:16,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1426371199, now seen corresponding path program 1 times [2025-03-16 19:37:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961371229] [2025-03-16 19:37:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:16,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:16,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:16,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:16,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:16,717 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,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:16,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961371229] [2025-03-16 19:37:16,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961371229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:16,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:16,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:16,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769911473] [2025-03-16 19:37:16,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:16,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:16,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:16,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:16,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:16,719 INFO L87 Difference]: Start difference. First operand 1733 states and 2364 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:18,162 INFO L93 Difference]: Finished difference Result 2892 states and 3969 transitions. [2025-03-16 19:37:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:18,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:18,167 INFO L225 Difference]: With dead ends: 2892 [2025-03-16 19:37:18,167 INFO L226 Difference]: Without dead ends: 2672 [2025-03-16 19:37:18,168 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:18,168 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 4839 mSDsluCounter, 5045 mSDsCounter, 0 mSdLazyCounter, 4333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4839 SdHoareTripleChecker+Valid, 6474 SdHoareTripleChecker+Invalid, 4337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:18,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4839 Valid, 6474 Invalid, 4337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4333 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2025-03-16 19:37:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1733. [2025-03-16 19:37:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.386737089201878) internal successors, (2363), 1732 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2363 transitions. [2025-03-16 19:37:18,184 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2363 transitions. Word has length 113 [2025-03-16 19:37:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:18,184 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2363 transitions. [2025-03-16 19:37:18,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2363 transitions. [2025-03-16 19:37:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:18,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:18,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:18,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:37:18,186 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:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1394782593, now seen corresponding path program 1 times [2025-03-16 19:37:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:18,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044632264] [2025-03-16 19:37:18,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:18,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:18,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:18,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:18,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:18,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:18,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:18,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044632264] [2025-03-16 19:37:18,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044632264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:18,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:18,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207833416] [2025-03-16 19:37:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:18,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:18,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:18,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:18,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:18,550 INFO L87 Difference]: Start difference. First operand 1733 states and 2363 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:19,825 INFO L93 Difference]: Finished difference Result 2839 states and 3884 transitions. [2025-03-16 19:37:19,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:19,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:19,829 INFO L225 Difference]: With dead ends: 2839 [2025-03-16 19:37:19,829 INFO L226 Difference]: Without dead ends: 2648 [2025-03-16 19:37:19,830 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:19,830 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 6235 mSDsluCounter, 3353 mSDsCounter, 0 mSdLazyCounter, 3222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6235 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:19,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6235 Valid, 4352 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3222 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-03-16 19:37:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1733. [2025-03-16 19:37:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.386150234741784) internal successors, (2362), 1732 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states 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,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2362 transitions. [2025-03-16 19:37:19,855 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2362 transitions. Word has length 113 [2025-03-16 19:37:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:19,856 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2362 transitions. [2025-03-16 19:37:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2362 transitions. [2025-03-16 19:37:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:19,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:19,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:19,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:37:19,858 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:19,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1022199597, now seen corresponding path program 1 times [2025-03-16 19:37:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38069912] [2025-03-16 19:37:19,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:19,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:19,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:19,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:19,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:20,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38069912] [2025-03-16 19:37:20,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38069912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358020720] [2025-03-16 19:37:20,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:20,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:20,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:20,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:20,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:20,199 INFO L87 Difference]: Start difference. First operand 1733 states and 2362 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:21,569 INFO L93 Difference]: Finished difference Result 2518 states and 3366 transitions. [2025-03-16 19:37:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:21,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:21,572 INFO L225 Difference]: With dead ends: 2518 [2025-03-16 19:37:21,573 INFO L226 Difference]: Without dead ends: 2512 [2025-03-16 19:37:21,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:21,573 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 4438 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4438 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:21,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4438 Valid, 3627 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2025-03-16 19:37:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1733. [2025-03-16 19:37:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3855633802816902) internal successors, (2361), 1732 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states 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,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2361 transitions. [2025-03-16 19:37:21,588 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2361 transitions. Word has length 113 [2025-03-16 19:37:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:21,588 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2361 transitions. [2025-03-16 19:37:21,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2361 transitions. [2025-03-16 19:37:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:37:21,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:21,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:21,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:37:21,591 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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:21,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:21,591 INFO L85 PathProgramCache]: Analyzing trace with hash -487353218, now seen corresponding path program 1 times [2025-03-16 19:37:21,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:21,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993964169] [2025-03-16 19:37:21,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:21,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:21,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:37:21,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:37:21,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:21,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:21,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:21,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993964169] [2025-03-16 19:37:21,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993964169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:21,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:21,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:21,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844564840] [2025-03-16 19:37:21,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:21,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:21,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:21,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:21,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:21,842 INFO L87 Difference]: Start difference. First operand 1733 states and 2361 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:23,094 INFO L93 Difference]: Finished difference Result 2688 states and 3617 transitions. [2025-03-16 19:37:23,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:23,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:37:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:23,108 INFO L225 Difference]: With dead ends: 2688 [2025-03-16 19:37:23,108 INFO L226 Difference]: Without dead ends: 2512 [2025-03-16 19:37:23,109 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:23,110 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 6608 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 2897 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6608 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:23,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6608 Valid, 3627 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2025-03-16 19:37:23,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1733. [2025-03-16 19:37:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3843896713615023) internal successors, (2359), 1732 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2359 transitions. [2025-03-16 19:37:23,127 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2359 transitions. Word has length 114 [2025-03-16 19:37:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:23,127 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2359 transitions. [2025-03-16 19:37:23,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2359 transitions. [2025-03-16 19:37:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:37:23,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:23,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:23,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:37:23,130 INFO L396 AbstractCegarLoop]: === Iteration 21 === 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:23,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:23,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1358215310, now seen corresponding path program 1 times [2025-03-16 19:37:23,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:23,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800141163] [2025-03-16 19:37:23,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:23,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:37:23,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:37:23,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:23,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:23,451 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:23,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800141163] [2025-03-16 19:37:23,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800141163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:23,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:23,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:23,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564329018] [2025-03-16 19:37:23,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:23,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:23,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:23,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:23,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:23,453 INFO L87 Difference]: Start difference. First operand 1733 states and 2359 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:24,908 INFO L93 Difference]: Finished difference Result 2899 states and 3970 transitions. [2025-03-16 19:37:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:24,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:37:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:24,911 INFO L225 Difference]: With dead ends: 2899 [2025-03-16 19:37:24,911 INFO L226 Difference]: Without dead ends: 2672 [2025-03-16 19:37:24,912 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:24,913 INFO L435 NwaCegarLoop]: 1428 mSDtfsCounter, 4825 mSDsluCounter, 5045 mSDsCounter, 0 mSdLazyCounter, 4311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4825 SdHoareTripleChecker+Valid, 6473 SdHoareTripleChecker+Invalid, 4315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:24,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4825 Valid, 6473 Invalid, 4315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4311 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2025-03-16 19:37:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1733. [2025-03-16 19:37:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3838028169014085) internal successors, (2358), 1732 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states 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:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2358 transitions. [2025-03-16 19:37:24,929 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2358 transitions. Word has length 114 [2025-03-16 19:37:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:24,929 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2358 transitions. [2025-03-16 19:37:24,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2358 transitions. [2025-03-16 19:37:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:37:24,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:24,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:24,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:37:24,931 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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:24,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1267491506, now seen corresponding path program 1 times [2025-03-16 19:37:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:24,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439181245] [2025-03-16 19:37:24,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:24,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:24,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:37:24,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:37:24,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:24,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:25,183 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,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:25,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439181245] [2025-03-16 19:37:25,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439181245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:25,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:25,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461532595] [2025-03-16 19:37:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:25,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:25,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:25,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:25,185 INFO L87 Difference]: Start difference. First operand 1733 states and 2358 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:26,406 INFO L93 Difference]: Finished difference Result 2780 states and 3776 transitions. [2025-03-16 19:37:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:26,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:37:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:26,410 INFO L225 Difference]: With dead ends: 2780 [2025-03-16 19:37:26,410 INFO L226 Difference]: Without dead ends: 2600 [2025-03-16 19:37:26,410 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,412 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 6407 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 3028 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6407 SdHoareTripleChecker+Valid, 4018 SdHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:26,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6407 Valid, 4018 Invalid, 3032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3028 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2025-03-16 19:37:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 1733. [2025-03-16 19:37:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3832159624413145) internal successors, (2357), 1732 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states 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,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2357 transitions. [2025-03-16 19:37:26,428 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2357 transitions. Word has length 114 [2025-03-16 19:37:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:26,428 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2357 transitions. [2025-03-16 19:37:26,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2357 transitions. [2025-03-16 19:37:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:37:26,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:26,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:26,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:37:26,431 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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:26,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1458684177, now seen corresponding path program 1 times [2025-03-16 19:37:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864602170] [2025-03-16 19:37:26,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:26,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:26,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:37:26,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:37:26,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:26,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:26,721 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,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:26,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864602170] [2025-03-16 19:37:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864602170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:26,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402065539] [2025-03-16 19:37:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:26,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:26,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:26,722 INFO L87 Difference]: Start difference. First operand 1733 states and 2357 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:27,907 INFO L93 Difference]: Finished difference Result 2777 states and 3771 transitions. [2025-03-16 19:37:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:27,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:37:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:27,914 INFO L225 Difference]: With dead ends: 2777 [2025-03-16 19:37:27,914 INFO L226 Difference]: Without dead ends: 2600 [2025-03-16 19:37:27,915 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:27,915 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 6408 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6408 SdHoareTripleChecker+Valid, 4017 SdHoareTripleChecker+Invalid, 3029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:27,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6408 Valid, 4017 Invalid, 3029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2025-03-16 19:37:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 1733. [2025-03-16 19:37:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3826291079812207) internal successors, (2356), 1732 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2356 transitions. [2025-03-16 19:37:27,932 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2356 transitions. Word has length 114 [2025-03-16 19:37:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:27,932 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2356 transitions. [2025-03-16 19:37:27,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2356 transitions. [2025-03-16 19:37:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:37:27,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:27,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:27,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:37:27,934 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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:27,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:27,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1021335489, now seen corresponding path program 1 times [2025-03-16 19:37:27,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:27,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684365058] [2025-03-16 19:37:27,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:27,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:37:27,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:37:27,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:27,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:28,188 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,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684365058] [2025-03-16 19:37:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684365058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043843575] [2025-03-16 19:37:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:28,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:28,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:28,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:28,190 INFO L87 Difference]: Start difference. First operand 1733 states and 2356 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:29,429 INFO L93 Difference]: Finished difference Result 2847 states and 3882 transitions. [2025-03-16 19:37:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:29,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:37:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:29,432 INFO L225 Difference]: With dead ends: 2847 [2025-03-16 19:37:29,432 INFO L226 Difference]: Without dead ends: 2648 [2025-03-16 19:37:29,433 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,433 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 3901 mSDsluCounter, 3487 mSDsCounter, 0 mSdLazyCounter, 3323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3901 SdHoareTripleChecker+Valid, 4532 SdHoareTripleChecker+Invalid, 3327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:29,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3901 Valid, 4532 Invalid, 3327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3323 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-03-16 19:37:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1733. [2025-03-16 19:37:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3820422535211268) internal successors, (2355), 1732 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states 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,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2355 transitions. [2025-03-16 19:37:29,453 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2355 transitions. Word has length 114 [2025-03-16 19:37:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:29,454 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2355 transitions. [2025-03-16 19:37:29,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2355 transitions. [2025-03-16 19:37:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:37:29,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:29,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:29,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:37:29,456 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1546048194, now seen corresponding path program 1 times [2025-03-16 19:37:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107994414] [2025-03-16 19:37:29,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:29,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:29,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:37:29,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:37:29,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:29,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:29,743 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,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:29,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107994414] [2025-03-16 19:37:29,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107994414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:29,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460875171] [2025-03-16 19:37:29,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:29,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:29,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:29,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:29,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:29,744 INFO L87 Difference]: Start difference. First operand 1733 states and 2355 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:31,036 INFO L93 Difference]: Finished difference Result 2900 states and 3964 transitions. [2025-03-16 19:37:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:37:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:31,039 INFO L225 Difference]: With dead ends: 2900 [2025-03-16 19:37:31,039 INFO L226 Difference]: Without dead ends: 2672 [2025-03-16 19:37:31,039 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:31,040 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4761 mSDsluCounter, 4200 mSDsCounter, 0 mSdLazyCounter, 3727 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 5719 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:31,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 5719 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2672 states. [2025-03-16 19:37:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2672 to 1733. [2025-03-16 19:37:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3814553990610328) internal successors, (2354), 1732 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2354 transitions. [2025-03-16 19:37:31,056 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2354 transitions. Word has length 114 [2025-03-16 19:37:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:31,056 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2354 transitions. [2025-03-16 19:37:31,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2354 transitions. [2025-03-16 19:37:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:37:31,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:31,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:31,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:37:31,059 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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:31,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1786535202, now seen corresponding path program 1 times [2025-03-16 19:37:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:31,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464817460] [2025-03-16 19:37:31,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:31,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:31,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:37:31,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:37:31,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:31,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:31,436 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,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464817460] [2025-03-16 19:37:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464817460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:31,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:31,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:31,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772669049] [2025-03-16 19:37:31,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:31,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:31,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:31,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:31,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:31,438 INFO L87 Difference]: Start difference. First operand 1733 states and 2354 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:32,786 INFO L93 Difference]: Finished difference Result 2842 states and 3876 transitions. [2025-03-16 19:37:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:32,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:37:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:32,792 INFO L225 Difference]: With dead ends: 2842 [2025-03-16 19:37:32,792 INFO L226 Difference]: Without dead ends: 2648 [2025-03-16 19:37:32,792 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:32,793 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 3304 mSDsluCounter, 4600 mSDsCounter, 0 mSdLazyCounter, 3985 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3304 SdHoareTripleChecker+Valid, 5811 SdHoareTripleChecker+Invalid, 3989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:32,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3304 Valid, 5811 Invalid, 3989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3985 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-03-16 19:37:32,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1733. [2025-03-16 19:37:32,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.380868544600939) internal successors, (2353), 1732 states have internal predecessors, (2353), 0 states have call successors, (0), 0 states 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,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2353 transitions. [2025-03-16 19:37:32,819 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2353 transitions. Word has length 114 [2025-03-16 19:37:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2353 transitions. [2025-03-16 19:37:32,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2353 transitions. [2025-03-16 19:37:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:32,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:32,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:32,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:37:32,821 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:32,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash -536806432, now seen corresponding path program 1 times [2025-03-16 19:37:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230407355] [2025-03-16 19:37:32,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:32,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:32,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:32,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:32,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:33,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230407355] [2025-03-16 19:37:33,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230407355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:33,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:33,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897518636] [2025-03-16 19:37:33,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:33,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:33,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:33,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:33,091 INFO L87 Difference]: Start difference. First operand 1733 states and 2353 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:34,500 INFO L93 Difference]: Finished difference Result 3156 states and 4311 transitions. [2025-03-16 19:37:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:34,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:34,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:34,502 INFO L225 Difference]: With dead ends: 3156 [2025-03-16 19:37:34,502 INFO L226 Difference]: Without dead ends: 2703 [2025-03-16 19:37:34,503 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:34,503 INFO L435 NwaCegarLoop]: 1415 mSDtfsCounter, 3248 mSDsluCounter, 4655 mSDsCounter, 0 mSdLazyCounter, 4269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3248 SdHoareTripleChecker+Valid, 6070 SdHoareTripleChecker+Invalid, 4272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:34,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3248 Valid, 6070 Invalid, 4272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4269 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:34,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2025-03-16 19:37:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 1733. [2025-03-16 19:37:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3796948356807512) internal successors, (2351), 1732 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states 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,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2351 transitions. [2025-03-16 19:37:34,518 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2351 transitions. Word has length 115 [2025-03-16 19:37:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:34,519 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2351 transitions. [2025-03-16 19:37:34,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2351 transitions. [2025-03-16 19:37:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:34,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:34,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:34,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:37:34,521 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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:34,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:34,522 INFO L85 PathProgramCache]: Analyzing trace with hash -514811616, now seen corresponding path program 1 times [2025-03-16 19:37:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068545172] [2025-03-16 19:37:34,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:34,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:34,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:34,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:34,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:34,760 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,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068545172] [2025-03-16 19:37:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068545172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584402769] [2025-03-16 19:37:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:34,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:34,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:34,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:34,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:34,761 INFO L87 Difference]: Start difference. First operand 1733 states and 2351 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:35,969 INFO L93 Difference]: Finished difference Result 2881 states and 3922 transitions. [2025-03-16 19:37:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:35,970 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:35,972 INFO L225 Difference]: With dead ends: 2881 [2025-03-16 19:37:35,972 INFO L226 Difference]: Without dead ends: 2648 [2025-03-16 19:37:35,973 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:35,973 INFO L435 NwaCegarLoop]: 1088 mSDtfsCounter, 3810 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 3439 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3810 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 3443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:35,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3810 Valid, 4703 Invalid, 3443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3439 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-03-16 19:37:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1733. [2025-03-16 19:37:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3785211267605635) internal successors, (2349), 1732 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2349 transitions. [2025-03-16 19:37:36,003 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2349 transitions. Word has length 115 [2025-03-16 19:37:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:36,003 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2349 transitions. [2025-03-16 19:37:36,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:36,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2349 transitions. [2025-03-16 19:37:36,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:36,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:36,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:36,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:37:36,006 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:36,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1806047328, now seen corresponding path program 1 times [2025-03-16 19:37:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:36,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525856806] [2025-03-16 19:37:36,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:36,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:36,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:36,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:36,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:36,347 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,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:36,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525856806] [2025-03-16 19:37:36,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525856806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:36,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:36,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:36,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768754549] [2025-03-16 19:37:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:36,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:36,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:36,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:36,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:36,353 INFO L87 Difference]: Start difference. First operand 1733 states and 2349 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:37,465 INFO L93 Difference]: Finished difference Result 2692 states and 3608 transitions. [2025-03-16 19:37:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:37,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:37,468 INFO L225 Difference]: With dead ends: 2692 [2025-03-16 19:37:37,468 INFO L226 Difference]: Without dead ends: 2512 [2025-03-16 19:37:37,469 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:37,469 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 4379 mSDsluCounter, 2787 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4379 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:37,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4379 Valid, 3681 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2025-03-16 19:37:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1733. [2025-03-16 19:37:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3773474178403755) internal successors, (2347), 1732 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states 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,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2347 transitions. [2025-03-16 19:37:37,485 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2347 transitions. Word has length 115 [2025-03-16 19:37:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:37,485 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2347 transitions. [2025-03-16 19:37:37,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2347 transitions. [2025-03-16 19:37:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:37,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:37,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:37,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:37:37,488 INFO L396 AbstractCegarLoop]: === Iteration 30 === 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:37,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1390460320, now seen corresponding path program 1 times [2025-03-16 19:37:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:37,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918415301] [2025-03-16 19:37:37,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:37,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:37,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:37,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:37,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:37,782 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,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918415301] [2025-03-16 19:37:37,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918415301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:37,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:37,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062832937] [2025-03-16 19:37:37,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:37,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:37,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:37,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:37,783 INFO L87 Difference]: Start difference. First operand 1733 states and 2347 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:39,005 INFO L93 Difference]: Finished difference Result 2874 states and 3907 transitions. [2025-03-16 19:37:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:39,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:39,008 INFO L225 Difference]: With dead ends: 2874 [2025-03-16 19:37:39,008 INFO L226 Difference]: Without dead ends: 2648 [2025-03-16 19:37:39,009 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:39,009 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 3293 mSDsluCounter, 4110 mSDsCounter, 0 mSdLazyCounter, 3633 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3293 SdHoareTripleChecker+Valid, 5321 SdHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:39,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3293 Valid, 5321 Invalid, 3637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3633 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:39,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2025-03-16 19:37:39,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 1733. [2025-03-16 19:37:39,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1704 states have (on average 1.3761737089201878) internal successors, (2345), 1732 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2345 transitions. [2025-03-16 19:37:39,021 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2345 transitions. Word has length 115 [2025-03-16 19:37:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:39,022 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2345 transitions. [2025-03-16 19:37:39,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2345 transitions. [2025-03-16 19:37:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:39,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:39,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:39,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:37:39,023 INFO L396 AbstractCegarLoop]: === Iteration 31 === 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:39,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash -155346608, now seen corresponding path program 1 times [2025-03-16 19:37:39,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:39,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416043739] [2025-03-16 19:37:39,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:39,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:39,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:39,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:39,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:39,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416043739] [2025-03-16 19:37:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416043739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:39,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:39,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887231008] [2025-03-16 19:37:39,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:39,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:39,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:39,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:39,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:39,527 INFO L87 Difference]: Start difference. First operand 1733 states and 2345 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:41,615 INFO L93 Difference]: Finished difference Result 3616 states and 4993 transitions. [2025-03-16 19:37:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:41,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:41,619 INFO L225 Difference]: With dead ends: 3616 [2025-03-16 19:37:41,619 INFO L226 Difference]: Without dead ends: 3336 [2025-03-16 19:37:41,620 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:41,620 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 9975 mSDsluCounter, 4706 mSDsCounter, 0 mSdLazyCounter, 4330 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9975 SdHoareTripleChecker+Valid, 6022 SdHoareTripleChecker+Invalid, 4636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 4330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:41,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9975 Valid, 6022 Invalid, 4636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 4330 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 19:37:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2025-03-16 19:37:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 1743. [2025-03-16 19:37:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1714 states have (on average 1.3739789964994165) internal successors, (2355), 1742 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states 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,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2355 transitions. [2025-03-16 19:37:41,637 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2355 transitions. Word has length 115 [2025-03-16 19:37:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:41,637 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2355 transitions. [2025-03-16 19:37:41,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2355 transitions. [2025-03-16 19:37:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:41,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:41,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:41,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:37:41,639 INFO L396 AbstractCegarLoop]: === Iteration 32 === 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:41,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash 150037136, now seen corresponding path program 1 times [2025-03-16 19:37:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:41,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754964556] [2025-03-16 19:37:41,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:41,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:41,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:41,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:41,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:41,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:41,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:41,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754964556] [2025-03-16 19:37:41,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754964556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:41,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:41,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860952115] [2025-03-16 19:37:41,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:41,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:41,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:41,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:41,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:41,915 INFO L87 Difference]: Start difference. First operand 1743 states and 2355 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:43,199 INFO L93 Difference]: Finished difference Result 2801 states and 3785 transitions. [2025-03-16 19:37:43,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:43,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:43,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:43,202 INFO L225 Difference]: With dead ends: 2801 [2025-03-16 19:37:43,202 INFO L226 Difference]: Without dead ends: 2610 [2025-03-16 19:37:43,203 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:43,203 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 3972 mSDsluCounter, 3354 mSDsCounter, 0 mSdLazyCounter, 3237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3972 SdHoareTripleChecker+Valid, 4382 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:43,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3972 Valid, 4382 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3237 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2025-03-16 19:37:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 1743. [2025-03-16 19:37:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1714 states have (on average 1.3728121353558926) internal successors, (2353), 1742 states have internal predecessors, (2353), 0 states have call successors, (0), 0 states 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,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2353 transitions. [2025-03-16 19:37:43,222 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2353 transitions. Word has length 115 [2025-03-16 19:37:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:43,222 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2353 transitions. [2025-03-16 19:37:43,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2353 transitions. [2025-03-16 19:37:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:43,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:43,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:43,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:37:43,228 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:43,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash -740739840, now seen corresponding path program 1 times [2025-03-16 19:37:43,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:43,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931758017] [2025-03-16 19:37:43,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:43,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:43,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:43,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:43,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:43,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:43,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931758017] [2025-03-16 19:37:43,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931758017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:43,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:43,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:43,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178584902] [2025-03-16 19:37:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:43,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:43,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:43,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:43,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:43,500 INFO L87 Difference]: Start difference. First operand 1743 states and 2353 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:44,595 INFO L93 Difference]: Finished difference Result 2528 states and 3352 transitions. [2025-03-16 19:37:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:44,598 INFO L225 Difference]: With dead ends: 2528 [2025-03-16 19:37:44,598 INFO L226 Difference]: Without dead ends: 2522 [2025-03-16 19:37:44,599 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:44,599 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 6472 mSDsluCounter, 2816 mSDsCounter, 0 mSdLazyCounter, 2914 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6472 SdHoareTripleChecker+Valid, 3720 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:44,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6472 Valid, 3720 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2914 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2025-03-16 19:37:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 1743. [2025-03-16 19:37:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1714 states have (on average 1.3716452742123688) internal successors, (2351), 1742 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2351 transitions. [2025-03-16 19:37:44,612 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2351 transitions. Word has length 115 [2025-03-16 19:37:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:44,612 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2351 transitions. [2025-03-16 19:37:44,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2351 transitions. [2025-03-16 19:37:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:44,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:44,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:44,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:37:44,614 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:44,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2099673041, now seen corresponding path program 1 times [2025-03-16 19:37:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399723264] [2025-03-16 19:37:44,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:44,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:44,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:44,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:44,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:44,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399723264] [2025-03-16 19:37:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399723264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:44,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294297824] [2025-03-16 19:37:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:44,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:44,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:44,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:44,882 INFO L87 Difference]: Start difference. First operand 1743 states and 2351 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:46,330 INFO L93 Difference]: Finished difference Result 2876 states and 3898 transitions. [2025-03-16 19:37:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:46,332 INFO L225 Difference]: With dead ends: 2876 [2025-03-16 19:37:46,332 INFO L226 Difference]: Without dead ends: 2658 [2025-03-16 19:37:46,333 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,333 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 3289 mSDsluCounter, 4600 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3289 SdHoareTripleChecker+Valid, 5810 SdHoareTripleChecker+Invalid, 3950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:46,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3289 Valid, 5810 Invalid, 3950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2025-03-16 19:37:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 1743. [2025-03-16 19:37:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1714 states have (on average 1.3704784130688448) internal successors, (2349), 1742 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2349 transitions. [2025-03-16 19:37:46,351 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2349 transitions. Word has length 115 [2025-03-16 19:37:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:46,351 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2349 transitions. [2025-03-16 19:37:46,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2349 transitions. [2025-03-16 19:37:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:46,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:46,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:46,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:37:46,353 INFO L396 AbstractCegarLoop]: === Iteration 35 === 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,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash 557392913, now seen corresponding path program 1 times [2025-03-16 19:37:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:46,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288655407] [2025-03-16 19:37:46,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:46,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:46,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:46,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:46,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:46,581 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:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:46,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288655407] [2025-03-16 19:37:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288655407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:46,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:46,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017404586] [2025-03-16 19:37:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:46,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:46,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:46,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:46,583 INFO L87 Difference]: Start difference. First operand 1743 states and 2349 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:47,726 INFO L93 Difference]: Finished difference Result 2798 states and 3773 transitions. [2025-03-16 19:37:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:47,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-16 19:37:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:47,729 INFO L225 Difference]: With dead ends: 2798 [2025-03-16 19:37:47,729 INFO L226 Difference]: Without dead ends: 2610 [2025-03-16 19:37:47,729 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:47,730 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 3932 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 3277 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3932 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:47,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3932 Valid, 4456 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3277 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2025-03-16 19:37:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 1743. [2025-03-16 19:37:47,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1714 states have (on average 1.369311551925321) internal successors, (2347), 1742 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states 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:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2347 transitions. [2025-03-16 19:37:47,741 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2347 transitions. Word has length 115 [2025-03-16 19:37:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:47,741 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2347 transitions. [2025-03-16 19:37:47,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2347 transitions. [2025-03-16 19:37:47,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:37:47,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:47,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:47,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:37:47,743 INFO L396 AbstractCegarLoop]: === Iteration 36 === 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:47,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1899251230, now seen corresponding path program 1 times [2025-03-16 19:37:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:47,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895297980] [2025-03-16 19:37:47,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:47,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:37:47,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:37:47,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:47,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:48,144 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,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:48,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895297980] [2025-03-16 19:37:48,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895297980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:48,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825087659] [2025-03-16 19:37:48,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:48,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:48,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:48,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:48,146 INFO L87 Difference]: Start difference. First operand 1743 states and 2347 transitions. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)