./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:16:05,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:16:05,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:16:05,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:16:05,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:16:05,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:16:05,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:16:05,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:16:05,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:16:05,067 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:16:05,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:16:05,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:16:05,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:16:05,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:16:05,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:16:05,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:16:05,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:05,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:16:05,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:16:05,069 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-jdk21/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 -> 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 [2025-02-07 20:16:05,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:16:05,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:16:05,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:16:05,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:16:05,246 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:16:05,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2025-02-07 20:16:06,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/411cfd0c6/1ce3cf17c58f48bca97d44c0a9f1a411/FLAGed1a3496e [2025-02-07 20:16:06,733 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:16:06,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2025-02-07 20:16:06,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/411cfd0c6/1ce3cf17c58f48bca97d44c0a9f1a411/FLAGed1a3496e [2025-02-07 20:16:06,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/411cfd0c6/1ce3cf17c58f48bca97d44c0a9f1a411 [2025-02-07 20:16:06,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:16:06,961 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:16:06,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:06,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:16:06,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:16:06,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:06" (1/1) ... [2025-02-07 20:16:06,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f51b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:06, skipping insertion in model container [2025-02-07 20:16:06,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:16:06" (1/1) ... [2025-02-07 20:16:07,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:16:07,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2025-02-07 20:16:07,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2025-02-07 20:16:07,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2025-02-07 20:16:07,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2025-02-07 20:16:07,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2025-02-07 20:16:07,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2025-02-07 20:16:07,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2025-02-07 20:16:07,439 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2025-02-07 20:16:07,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2025-02-07 20:16:07,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2025-02-07 20:16:07,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2025-02-07 20:16:07,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2025-02-07 20:16:07,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2025-02-07 20:16:07,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2025-02-07 20:16:07,454 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2025-02-07 20:16:07,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2025-02-07 20:16:07,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:07,489 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:16:07,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2025-02-07 20:16:07,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2025-02-07 20:16:07,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2025-02-07 20:16:07,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2025-02-07 20:16:07,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2025-02-07 20:16:07,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2025-02-07 20:16:07,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2025-02-07 20:16:07,641 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2025-02-07 20:16:07,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2025-02-07 20:16:07,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2025-02-07 20:16:07,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2025-02-07 20:16:07,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2025-02-07 20:16:07,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2025-02-07 20:16:07,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2025-02-07 20:16:07,650 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2025-02-07 20:16:07,651 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2025-02-07 20:16:07,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:16:07,670 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:16:07,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07 WrapperNode [2025-02-07 20:16:07,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:16:07,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:07,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:16:07,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:16:07,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,778 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3587 [2025-02-07 20:16:07,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:16:07,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:16:07,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:16:07,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:16:07,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,866 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-02-07 20:16:07,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:16:07,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:16:07,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:16:07,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:16:07,925 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (1/1) ... [2025-02-07 20:16:07,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:16:07,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:16:07,952 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:16:07,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:16:07,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:16:07,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:16:07,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:16:07,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:16:08,160 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:16:08,162 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3471: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~main____CPAchecker_TMP_1~41#1;havoc main_~__tmp_200~0#1, main_~__VERIFIER_assert__cond~199#1;havoc main_~__tmp_199~0#1, main_~__VERIFIER_assert__cond~198#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1159: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~main____CPAchecker_TMP_1~7#1;havoc main_~__tmp_64~0#1, main_~__VERIFIER_assert__cond~63#1;havoc main_~__tmp_63~0#1, main_~__VERIFIER_assert__cond~62#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2613: havoc main_~main____CPAchecker_TMP_2~29#1;havoc main_~__tmp_150~0#1, main_~__VERIFIER_assert__cond~149#1;havoc main_~__tmp_149~0#1, main_~__VERIFIER_assert__cond~148#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L500: havoc main_~main____CPAchecker_TMP_7~2#1;havoc main_~__tmp_28~0#1, main_~__VERIFIER_assert__cond~27#1;havoc main_~__tmp_27~0#1, main_~__VERIFIER_assert__cond~26#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3539: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~main____CPAchecker_TMP_1~42#1;havoc main_~__tmp_204~0#1, main_~__VERIFIER_assert__cond~203#1;havoc main_~__tmp_203~0#1, main_~__VERIFIER_assert__cond~202#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1227: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~main____CPAchecker_TMP_1~8#1;havoc main_~__tmp_68~0#1, main_~__VERIFIER_assert__cond~67#1;havoc main_~__tmp_67~0#1, main_~__VERIFIER_assert__cond~66#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2681: havoc main_~main____CPAchecker_TMP_2~30#1;havoc main_~__tmp_154~0#1, main_~__VERIFIER_assert__cond~153#1;havoc main_~__tmp_153~0#1, main_~__VERIFIER_assert__cond~152#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1;havoc main_~main____CPAchecker_TMP_5~0#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4730: havoc main_~main____CPAchecker_TMP_2~60#1;havoc main_~__tmp_274~0#1, main_~__VERIFIER_assert__cond~273#1;havoc main_~__tmp_273~0#1, main_~__VERIFIER_assert__cond~272#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~main____CPAchecker_TMP_1~59#1;havoc main_~__tmp_272~0#1, main_~__VERIFIER_assert__cond~271#1;havoc main_~__tmp_271~0#1, main_~__VERIFIER_assert__cond~270#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3607: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~main____CPAchecker_TMP_1~43#1;havoc main_~__tmp_208~0#1, main_~__VERIFIER_assert__cond~207#1;havoc main_~__tmp_207~0#1, main_~__VERIFIER_assert__cond~206#1; [2025-02-07 20:16:09,463 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~main____CPAchecker_TMP_1~9#1;havoc main_~__tmp_72~0#1, main_~__VERIFIER_assert__cond~71#1;havoc main_~__tmp_71~0#1, main_~__VERIFIER_assert__cond~70#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749: havoc main_~main____CPAchecker_TMP_2~31#1;havoc main_~__tmp_158~0#1, main_~__VERIFIER_assert__cond~157#1;havoc main_~__tmp_157~0#1, main_~__VERIFIER_assert__cond~156#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3675: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~main____CPAchecker_TMP_1~44#1;havoc main_~__tmp_212~0#1, main_~__VERIFIER_assert__cond~211#1;havoc main_~__tmp_211~0#1, main_~__VERIFIER_assert__cond~210#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1363: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~main____CPAchecker_TMP_1~10#1;havoc main_~__tmp_76~0#1, main_~__VERIFIER_assert__cond~75#1;havoc main_~__tmp_75~0#1, main_~__VERIFIER_assert__cond~74#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2817: havoc main_~main____CPAchecker_TMP_2~32#1;havoc main_~__tmp_162~0#1, main_~__VERIFIER_assert__cond~161#1;havoc main_~__tmp_161~0#1, main_~__VERIFIER_assert__cond~160#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1;havoc main_~main____CPAchecker_TMP_5~1#1;havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3743: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~main____CPAchecker_TMP_1~45#1;havoc main_~__tmp_216~0#1, main_~__VERIFIER_assert__cond~215#1;havoc main_~__tmp_215~0#1, main_~__VERIFIER_assert__cond~214#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1431: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~main____CPAchecker_TMP_1~11#1;havoc main_~__tmp_80~0#1, main_~__VERIFIER_assert__cond~79#1;havoc main_~__tmp_79~0#1, main_~__VERIFIER_assert__cond~78#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: havoc main_~main____CPAchecker_TMP_2~33#1;havoc main_~__tmp_166~0#1, main_~__VERIFIER_assert__cond~165#1;havoc main_~__tmp_165~0#1, main_~__VERIFIER_assert__cond~164#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L243: havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3811: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~main____CPAchecker_TMP_1~46#1;havoc main_~__tmp_220~0#1, main_~__VERIFIER_assert__cond~219#1;havoc main_~__tmp_219~0#1, main_~__VERIFIER_assert__cond~218#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1499: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~main____CPAchecker_TMP_1~12#1;havoc main_~__tmp_84~0#1, main_~__VERIFIER_assert__cond~83#1;havoc main_~__tmp_83~0#1, main_~__VERIFIER_assert__cond~82#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2953: havoc main_~main____CPAchecker_TMP_2~34#1;havoc main_~__tmp_170~0#1, main_~__VERIFIER_assert__cond~169#1;havoc main_~__tmp_169~0#1, main_~__VERIFIER_assert__cond~168#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4870: havoc main_~main____CPAchecker_TMP_7~3#1;havoc main_~__tmp_282~0#1, main_~__VERIFIER_assert__cond~281#1;havoc main_~__tmp_281~0#1, main_~__VERIFIER_assert__cond~280#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3879: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~main____CPAchecker_TMP_1~47#1;havoc main_~__tmp_224~0#1, main_~__VERIFIER_assert__cond~223#1;havoc main_~__tmp_223~0#1, main_~__VERIFIER_assert__cond~222#1; [2025-02-07 20:16:09,464 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~main____CPAchecker_TMP_1~13#1;havoc main_~__tmp_88~0#1, main_~__VERIFIER_assert__cond~87#1;havoc main_~__tmp_87~0#1, main_~__VERIFIER_assert__cond~86#1; [2025-02-07 20:16:09,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3021: havoc main_~main____CPAchecker_TMP_2~35#1;havoc main_~__tmp_174~0#1, main_~__VERIFIER_assert__cond~173#1;havoc main_~__tmp_173~0#1, main_~__VERIFIER_assert__cond~172#1; [2025-02-07 20:16:09,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~__tmp_38~0#1, main_~__VERIFIER_assert__cond~37#1;havoc main_~__tmp_37~0#1, main_~__VERIFIER_assert__cond~36#1; [2025-02-07 20:16:09,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc main_~__tmp_32~0#1, main_~__VERIFIER_assert__cond~31#1;havoc main_~__tmp_31~0#1, main_~__VERIFIER_assert__cond~30#1;havoc main_~main____CPAchecker_TMP_6~1#1; [2025-02-07 20:16:09,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3947: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~main____CPAchecker_TMP_1~48#1;havoc main_~__tmp_228~0#1, main_~__VERIFIER_assert__cond~227#1;havoc main_~__tmp_227~0#1, main_~__VERIFIER_assert__cond~226#1; [2025-02-07 20:16:09,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1635: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~main____CPAchecker_TMP_1~14#1;havoc main_~__tmp_92~0#1, main_~__VERIFIER_assert__cond~91#1;havoc main_~__tmp_91~0#1, main_~__VERIFIER_assert__cond~90#1; [2025-02-07 20:16:09,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089: havoc main_~main____CPAchecker_TMP_2~36#1;havoc main_~__tmp_178~0#1, main_~__VERIFIER_assert__cond~177#1;havoc main_~__tmp_177~0#1, main_~__VERIFIER_assert__cond~176#1; [2025-02-07 20:16:09,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~main____CPAchecker_TMP_2~2#1;havoc main_~__tmp_42~0#1, main_~__VERIFIER_assert__cond~41#1;havoc main_~__tmp_41~0#1, main_~__VERIFIER_assert__cond~40#1; [2025-02-07 20:16:09,466 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: havoc main_~__tmp_26~0#1, main_~__VERIFIER_assert__cond~25#1;havoc main_~__tmp_25~0#1, main_~__VERIFIER_assert__cond~24#1;havoc main_~main____CPAchecker_TMP_5~2#1;havoc main_~__tmp_24~0#1, main_~__VERIFIER_assert__cond~23#1;havoc main_~__tmp_23~0#1, main_~__VERIFIER_assert__cond~22#1; [2025-02-07 20:16:09,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4015: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~main____CPAchecker_TMP_1~49#1;havoc main_~__tmp_232~0#1, main_~__VERIFIER_assert__cond~231#1;havoc main_~__tmp_231~0#1, main_~__VERIFIER_assert__cond~230#1; [2025-02-07 20:16:09,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1703: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~main____CPAchecker_TMP_1~15#1;havoc main_~__tmp_96~0#1, main_~__VERIFIER_assert__cond~95#1;havoc main_~__tmp_95~0#1, main_~__VERIFIER_assert__cond~94#1; [2025-02-07 20:16:09,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3157: havoc main_~main____CPAchecker_TMP_2~37#1;havoc main_~__tmp_182~0#1, main_~__VERIFIER_assert__cond~181#1;havoc main_~__tmp_181~0#1, main_~__VERIFIER_assert__cond~180#1; [2025-02-07 20:16:09,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L845: havoc main_~main____CPAchecker_TMP_2~3#1;havoc main_~__tmp_46~0#1, main_~__VERIFIER_assert__cond~45#1;havoc main_~__tmp_45~0#1, main_~__VERIFIER_assert__cond~44#1; [2025-02-07 20:16:09,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: havoc main_~__tmp_22~0#1, main_~__VERIFIER_assert__cond~21#1;havoc main_~__tmp_21~0#1, main_~__VERIFIER_assert__cond~20#1; [2025-02-07 20:16:09,467 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4083: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~main____CPAchecker_TMP_1~50#1;havoc main_~__tmp_236~0#1, main_~__VERIFIER_assert__cond~235#1;havoc main_~__tmp_235~0#1, main_~__VERIFIER_assert__cond~234#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1771: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~main____CPAchecker_TMP_1~16#1;havoc main_~__tmp_100~0#1, main_~__VERIFIER_assert__cond~99#1;havoc main_~__tmp_99~0#1, main_~__VERIFIER_assert__cond~98#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: havoc main_~main____CPAchecker_TMP_2~38#1;havoc main_~__tmp_186~0#1, main_~__VERIFIER_assert__cond~185#1;havoc main_~__tmp_185~0#1, main_~__VERIFIER_assert__cond~184#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L913: havoc main_~main____CPAchecker_TMP_2~4#1;havoc main_~__tmp_50~0#1, main_~__VERIFIER_assert__cond~49#1;havoc main_~__tmp_49~0#1, main_~__VERIFIER_assert__cond~48#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4151: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~main____CPAchecker_TMP_1~51#1;havoc main_~__tmp_240~0#1, main_~__VERIFIER_assert__cond~239#1;havoc main_~__tmp_239~0#1, main_~__VERIFIER_assert__cond~238#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1839: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~main____CPAchecker_TMP_1~17#1;havoc main_~__tmp_104~0#1, main_~__VERIFIER_assert__cond~103#1;havoc main_~__tmp_103~0#1, main_~__VERIFIER_assert__cond~102#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3293: havoc main_~main____CPAchecker_TMP_2~39#1;havoc main_~__tmp_190~0#1, main_~__VERIFIER_assert__cond~189#1;havoc main_~__tmp_189~0#1, main_~__VERIFIER_assert__cond~188#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: havoc main_~main____CPAchecker_TMP_2~5#1;havoc main_~__tmp_54~0#1, main_~__VERIFIER_assert__cond~53#1;havoc main_~__tmp_53~0#1, main_~__VERIFIER_assert__cond~52#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4219: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~main____CPAchecker_TMP_1~52#1;havoc main_~__tmp_244~0#1, main_~__VERIFIER_assert__cond~243#1;havoc main_~__tmp_243~0#1, main_~__VERIFIER_assert__cond~242#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~main____CPAchecker_TMP_1~18#1;havoc main_~__tmp_108~0#1, main_~__VERIFIER_assert__cond~107#1;havoc main_~__tmp_107~0#1, main_~__VERIFIER_assert__cond~106#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4748: havoc main_~__tmp_276~0#1, main_~__VERIFIER_assert__cond~275#1;havoc main_~__tmp_275~0#1, main_~__VERIFIER_assert__cond~274#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3361: havoc main_~main____CPAchecker_TMP_2~40#1;havoc main_~__tmp_194~0#1, main_~__VERIFIER_assert__cond~193#1;havoc main_~__tmp_193~0#1, main_~__VERIFIER_assert__cond~192#1; [2025-02-07 20:16:09,468 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: havoc main_~main____CPAchecker_TMP_2~6#1;havoc main_~__tmp_58~0#1, main_~__VERIFIER_assert__cond~57#1;havoc main_~__tmp_57~0#1, main_~__VERIFIER_assert__cond~56#1; [2025-02-07 20:16:09,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4287: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~main____CPAchecker_TMP_1~53#1;havoc main_~__tmp_248~0#1, main_~__VERIFIER_assert__cond~247#1;havoc main_~__tmp_247~0#1, main_~__VERIFIER_assert__cond~246#1; [2025-02-07 20:16:09,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~main____CPAchecker_TMP_3~0#1; [2025-02-07 20:16:09,469 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1975: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~main____CPAchecker_TMP_1~19#1;havoc main_~__tmp_112~0#1, main_~__VERIFIER_assert__cond~111#1;havoc main_~__tmp_111~0#1, main_~__VERIFIER_assert__cond~110#1; [2025-02-07 20:16:09,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4816: havoc main_~__tmp_280~0#1, main_~__VERIFIER_assert__cond~279#1;havoc main_~__tmp_279~0#1, main_~__VERIFIER_assert__cond~278#1;havoc main_~main____CPAchecker_TMP_5~3#1;havoc main_~__tmp_278~0#1, main_~__VERIFIER_assert__cond~277#1;havoc main_~__tmp_277~0#1, main_~__VERIFIER_assert__cond~276#1; [2025-02-07 20:16:09,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3429: havoc main_~main____CPAchecker_TMP_2~41#1;havoc main_~__tmp_198~0#1, main_~__VERIFIER_assert__cond~197#1;havoc main_~__tmp_197~0#1, main_~__VERIFIER_assert__cond~196#1; [2025-02-07 20:16:09,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: havoc main_~main____CPAchecker_TMP_2~7#1;havoc main_~__tmp_62~0#1, main_~__VERIFIER_assert__cond~61#1;havoc main_~__tmp_61~0#1, main_~__VERIFIER_assert__cond~60#1; [2025-02-07 20:16:09,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4355: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~main____CPAchecker_TMP_1~54#1;havoc main_~__tmp_252~0#1, main_~__VERIFIER_assert__cond~251#1;havoc main_~__tmp_251~0#1, main_~__VERIFIER_assert__cond~250#1; [2025-02-07 20:16:09,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2043: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~main____CPAchecker_TMP_1~20#1;havoc main_~__tmp_116~0#1, main_~__VERIFIER_assert__cond~115#1;havoc main_~__tmp_115~0#1, main_~__VERIFIER_assert__cond~114#1; [2025-02-07 20:16:09,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3497: havoc main_~main____CPAchecker_TMP_2~42#1;havoc main_~__tmp_202~0#1, main_~__VERIFIER_assert__cond~201#1;havoc main_~__tmp_201~0#1, main_~__VERIFIER_assert__cond~200#1; [2025-02-07 20:16:09,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1185: havoc main_~main____CPAchecker_TMP_2~8#1;havoc main_~__tmp_66~0#1, main_~__VERIFIER_assert__cond~65#1;havoc main_~__tmp_65~0#1, main_~__VERIFIER_assert__cond~64#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4423: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~main____CPAchecker_TMP_1~55#1;havoc main_~__tmp_256~0#1, main_~__VERIFIER_assert__cond~255#1;havoc main_~__tmp_255~0#1, main_~__VERIFIER_assert__cond~254#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~main____CPAchecker_TMP_3~1#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc main_~main____CPAchecker_TMP_4~0#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2111: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~main____CPAchecker_TMP_1~21#1;havoc main_~__tmp_120~0#1, main_~__VERIFIER_assert__cond~119#1;havoc main_~__tmp_119~0#1, main_~__VERIFIER_assert__cond~118#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3565: havoc main_~main____CPAchecker_TMP_2~43#1;havoc main_~__tmp_206~0#1, main_~__VERIFIER_assert__cond~205#1;havoc main_~__tmp_205~0#1, main_~__VERIFIER_assert__cond~204#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~main____CPAchecker_TMP_2~9#1;havoc main_~__tmp_70~0#1, main_~__VERIFIER_assert__cond~69#1;havoc main_~__tmp_69~0#1, main_~__VERIFIER_assert__cond~68#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4491: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~main____CPAchecker_TMP_1~56#1;havoc main_~__tmp_260~0#1, main_~__VERIFIER_assert__cond~259#1;havoc main_~__tmp_259~0#1, main_~__VERIFIER_assert__cond~258#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2179: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~main____CPAchecker_TMP_1~22#1;havoc main_~__tmp_124~0#1, main_~__VERIFIER_assert__cond~123#1;havoc main_~__tmp_123~0#1, main_~__VERIFIER_assert__cond~122#1; [2025-02-07 20:16:09,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc main_~main____CPAchecker_TMP_0~0#1; [2025-02-07 20:16:09,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret78#1 := main_#res#1;havoc main_#t~nondet4#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_#t~nondet5#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_5~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_5~1#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_22~0#1, main_~__VERIFIER_assert__cond~21#1, main_~__tmp_21~0#1, main_~__VERIFIER_assert__cond~20#1, main_#t~nondet10#1, main_#t~nondet11#1, main_~__tmp_26~0#1, main_~__VERIFIER_assert__cond~25#1, main_~__tmp_25~0#1, main_~__VERIFIER_assert__cond~24#1, main_~main____CPAchecker_TMP_5~2#1, main_~__tmp_24~0#1, main_~__VERIFIER_assert__cond~23#1, main_~__tmp_23~0#1, main_~__VERIFIER_assert__cond~22#1, main_~main____CPAchecker_TMP_7~2#1, main_~__tmp_28~0#1, main_~__VERIFIER_assert__cond~27#1, main_~__tmp_27~0#1, main_~__VERIFIER_assert__cond~26#1, main_~main____CPAchecker_TMP_4~2#1, main_#t~nondet12#1, main_~__tmp_30~0#1, main_~__VERIFIER_assert__cond~29#1, main_~__tmp_29~0#1, main_~__VERIFIER_assert__cond~28#1, main_~main____CPAchecker_TMP_6~0#1, main_~main____CPAchecker_TMP_3~2#1, main_~main____CPAchecker_TMP_7~1#1, main_~__tmp_20~0#1, main_~__VERIFIER_assert__cond~19#1, main_~__tmp_19~0#1, main_~__VERIFIER_assert__cond~18#1, main_~main____CPAchecker_TMP_4~1#1, main_#t~nondet13#1, main_~__tmp_32~0#1, main_~__VERIFIER_assert__cond~31#1, main_~__tmp_31~0#1, main_~__VERIFIER_assert__cond~30#1, main_~main____CPAchecker_TMP_6~1#1, main_~main____CPAchecker_TMP_3~1#1, main_~main____CPAchecker_TMP_7~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~main____CPAchecker_TMP_4~0#1, main_#t~nondet14#1, main_~__tmp_34~0#1, main_~__VERIFIER_assert__cond~33#1, main_~__tmp_33~0#1, main_~__VERIFIER_assert__cond~32#1, main_~main____CPAchecker_TMP_6~2#1, main_~main____CPAchecker_TMP_3~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_#t~nondet15#1, main_~main____CPAchecker_TMP_2~1#1, main_~__tmp_38~0#1, main_~__VERIFIER_assert__cond~37#1, main_~__tmp_37~0#1, main_~__VERIFIER_assert__cond~36#1, main_#t~nondet16#1, main_~main____CPAchecker_TMP_2~2#1, main_~__tmp_42~0#1, main_~__VERIFIER_assert__cond~41#1, main_~__tmp_41~0#1, main_~__VERIFIER_assert__cond~40#1, main_#t~nondet17#1, main_~main____CPAchecker_TMP_2~3#1, main_~__tmp_46~0#1, main_~__VERIFIER_assert__cond~45#1, main_~__tmp_45~0#1, main_~__VERIFIER_assert__cond~44#1, main_#t~nondet18#1, main_~main____CPAchecker_TMP_2~4#1, main_~__tmp_50~0#1, main_~__VERIFIER_assert__cond~49#1, main_~__tmp_49~0#1, main_~__VERIFIER_assert__cond~48#1, main_#t~nondet19#1, main_~main____CPAchecker_TMP_2~5#1, main_~__tmp_54~0#1, main_~__VERIFIER_assert__cond~53#1, main_~__tmp_53~0#1, main_~__VERIFIER_assert__cond~52#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_2~6#1, main_~__tmp_58~0#1, main_~__VERIFIER_assert__cond~57#1, main_~__tmp_57~0#1, main_~__VERIFIER_assert__cond~56#1, main_#t~nondet21#1, main_~main____CPAchecker_TMP_2~7#1, main_~__tmp_62~0#1, main_~__VERIFIER_assert__cond~61#1, main_~__tmp_61~0#1, main_~__VERIFIER_assert__cond~60#1, main_#t~nondet22#1, main_~main____CPAchecker_TMP_2~8#1, main_~__tmp_66~0#1, main_~__VERIFIER_assert__cond~65#1, main_~__tmp_65~0#1, main_~__VERIFIER_assert__cond~64#1, main_#t~nondet23#1, main_~main____CPAchecker_TMP_2~9#1, main_~__tmp_70~0#1, main_~__VERIFIER_assert__cond~69#1, main_~__tmp_69~0#1, main_~__VERIFIER_assert__cond~68#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_2~10#1, main_~__tmp_74~0#1, main_~__VERIFIER_assert__cond~73#1, main_~__tmp_73~0#1, main_~__VERIFIER_assert__cond~72#1, main_#t~nondet25#1, main_~main____CPAchecker_TMP_2~11#1, main_~__tmp_78~0#1, main_~__VERIFIER_assert__cond~77#1, main_~__tmp_77~0#1, main_~__VERIFIER_assert__cond~76#1, main_#t~nondet26#1, main_~main____CPAchecker_TMP_2~12#1, main_~__tmp_82~0#1, main_~__VERIFIER_assert__cond~81#1, main_~__tmp_81~0#1, main_~__VERIFIER_assert__cond~80#1, main_#t~nondet27#1, main_~main____CPAchecker_TMP_2~13#1, main_~__tmp_86~0#1, main_~__VERIFIER_assert__cond~85#1, main_~__tmp_85~0#1, main_~__VERIFIER_assert__cond~84#1, main_#t~nondet28#1, main_~main____CPAchecker_TMP_2~14#1, main_~__tmp_90~0#1, main_~__VERIFIER_assert__cond~89#1, main_~__tmp_89~0#1, main_~__VERIFIER_assert__cond~88#1, main_#t~nondet29#1, main_~main____CPAchecker_TMP_2~15#1, main_~__tmp_94~0#1, main_~__VERIFIER_assert__cond~93#1, main_~__tmp_93~0#1, main_~__VERIFIER_assert__cond~92#1, main_#t~nondet30#1, main_~main____CPAchecker_TMP_2~16#1, main_~__tmp_98~0#1, main_~__VERIFIER_assert__cond~97#1, main_~__tmp_97~0#1, main_~__VERIFIER_assert__cond~96#1, main_#t~nondet31#1, main_~main____CPAchecker_TMP_2~17#1, main_~__tmp_102~0#1, main_~__VERIFIER_assert__cond~101#1, main_~__tmp_101~0#1, main_~__VERIFIER_assert__cond~100#1, main_#t~nondet32#1, main_~main____CPAchecker_TMP_2~18#1, main_~__tmp_106~0#1, main_~__VERIFIER_assert__cond~105#1, main_~__tmp_105~0#1, main_~__VERIFIER_assert__cond~104#1, main_#t~nondet33#1, main_~main____CPAchecker_TMP_2~19#1, main_~__tmp_110~0#1, main_~__VERIFIER_assert__cond~109#1, main_~__tmp_109~0#1, main_~__VERIFIER_assert__cond~108#1, main_#t~nondet34#1, main_~main____CPAchecker_TMP_2~20#1, main_~__tmp_114~0#1, main_~__VERIFIER_assert__cond~113#1, main_~__tmp_113~0#1, main_~__VERIFIER_assert__cond~112#1, main_#t~nondet35#1, main_~main____CPAchecker_TMP_2~21#1, main_~__tmp_118~0#1, main_~__VERIFIER_assert__cond~117#1, main_~__tmp_117~0#1, main_~__VERIFIER_assert__cond~116#1, main_#t~nondet36#1, main_~main____CPAchecker_TMP_2~22#1, main_~__tmp_122~0#1, main_~__VERIFIER_assert__cond~121#1, main_~__tmp_121~0#1, main_~__VERIFIER_assert__cond~120#1, main_#t~nondet37#1, main_~main____CPAchecker_TMP_2~23#1, main_~__tmp_126~0#1, main_~__VERIFIER_assert__cond~125#1, main_~__tmp_125~0#1, main_~__VERIFIER_assert__cond~124#1, main_#t~nondet38#1, main_~main____CPAchecker_TMP_2~24#1, main_~__tmp_130~0#1, main_~__VERIFIER_assert__cond~129#1, main_~__tmp_129~0#1, main_~__VERIFIER_assert__cond~128#1, main_#t~nondet39#1, main_~main____CPAchecker_TMP_2~25#1, main_~__tmp_134~0#1, main_~__VERIFIER_assert__cond~133#1, main_~__tmp_133~0#1, main_~__VERIFIER_assert__cond~132#1, main_#t~nondet40#1, main_~main____CPAchecker_TMP_2~26#1, main_~__tmp_138~0#1, main_~__VERIFIER_assert__cond~137#1, main_~__tmp_137~0#1, main_~__VERIFIER_assert__cond~136#1, main_#t~nondet41#1, main_~main____CPAchecker_TMP_2~27#1, main_~__tmp_142~0#1, main_~__VERIFIER_assert__cond~141#1, main_~__tmp_141~0#1, main_~__VERIFIER_assert__cond~140#1, main_#t~nondet42#1, main_~main____CPAchecker_TMP_2~28#1, main_~__tmp_146~0#1, main_~__VERIFIER_assert__cond~145#1, main_~__tmp_145~0#1, main_~__VERIFIER_assert__cond~144#1, main_#t~nondet43#1, main_~main____CPAchecker_TMP_2~29#1, main_~__tmp_150~0#1, main_~__VERIFIER_assert__cond~149#1, main_~__tmp_149~0#1, main_~__VERIFIER_assert__cond~148#1, main_#t~nondet44#1, main_~main____CPAchecker_TMP_2~30#1, main_~__tmp_154~0#1, main_~__VERIFIER_assert__cond~153#1, main_~__tmp_153~0#1, main_~__VERIFIER_assert__cond~152#1, main_#t~nondet45#1, main_~main____CPAchecker_TMP_2~31#1, main_~__tmp_158~0#1, main_~__VERIFIER_assert__cond~157#1, main_~__tmp_157~0#1, main_~__VERIFIER_assert__cond~156#1, main_#t~nondet46#1, main_~main____CPAchecker_TMP_2~32#1, main_~__tmp_162~0#1, main_~__VERIFIER_assert__cond~161#1, main_~__tmp_161~0#1, main_~__VERIFIER_assert__cond~160#1, main_#t~nondet47#1, main_~main____CPAchecker_TMP_2~33#1, main_~__tmp_166~0#1, main_~__VERIFIER_assert__cond~165#1, main_~__tmp_165~0#1, main_~__VERIFIER_assert__cond~164#1, main_#t~nondet48#1, main_~main____CPAchecker_TMP_2~34#1, main_~__tmp_170~0#1, main_~__VERIFIER_assert__cond~169#1, main_~__tmp_169~0#1, main_~__VERIFIER_assert__cond~168#1, main_#t~nondet49#1, main_~main____CPAchecker_TMP_2~35#1, main_~__tmp_174~0#1, main_~__VERIFIER_assert__cond~173#1, main_~__tmp_173~0#1, main_~__VERIFIER_assert__cond~172#1, main_#t~nondet50#1, main_~main____CPAchecker_TMP_2~36#1, main_~__tmp_178~0#1, main_~__VERIFIER_assert__cond~177#1, main_~__tmp_177~0#1, main_~__VERIFIER_assert__cond~176#1, main_#t~nondet51#1, main_~main____CPAchecker_TMP_2~37#1, main_~__tmp_182~0#1, main_~__VERIFIER_assert__cond~181#1, main_~__tmp_181~0#1, main_~__VERIFIER_assert__cond~180#1, main_#t~nondet52#1, main_~main____CPAchecker_TMP_2~38#1, main_~__tmp_186~0#1, main_~__VERIFIER_assert__cond~185#1, main_~__tmp_185~0#1, main_~__VERIFIER_assert__cond~184#1, main_#t~nondet53#1, main_~main____CPAchecker_TMP_2~39#1, main_~__tmp_190~0#1, main_~__VERIFIER_assert__cond~189#1, main_~__tmp_189~0#1, main_~__VERIFIER_assert__cond~188#1, main_#t~nondet54#1, main_~main____CPAchecker_TMP_2~40#1, main_~__tmp_194~0#1, main_~__VERIFIER_assert__cond~193#1, main_~__tmp_193~0#1, main_~__VERIFIER_assert__cond~192#1, main_#t~nondet55#1, main_~main____CPAchecker_TMP_2~41#1, main_~__tmp_198~0#1, main_~__VERIFIER_assert__cond~197#1, main_~__tmp_197~0#1, main_~__VERIFIER_assert__cond~196#1, main_#t~nondet56#1, main_~main____CPAchecker_TMP_2~42#1, main_~__tmp_202~0#1, main_~__VERIFIER_assert__cond~201#1, main_~__tmp_201~0#1, main_~__VERIFIER_assert__cond~200#1, main_#t~nondet57#1, main_~main____CPAchecker_TMP_2~43#1, main_~__tmp_206~0#1, main_~__VERIFIER_assert__cond~205#1, main_~__tmp_205~0#1, main_~__VERIFIER_assert__cond~204#1, main_#t~nondet58#1, main_~main____CPAchecker_TMP_2~44#1, main_~__tmp_210~0#1, main_~__VERIFIER_assert__cond~209#1, main_~__tmp_209~0#1, main_~__VERIFIER_assert__cond~208#1, main_#t~nondet59#1, main_~main____CPAchecker_TMP_2~45#1, main_~__tmp_214~0#1, main_~__VERIFIER_assert__cond~213#1, main_~__tmp_213~0#1, main_~__VERIFIER_assert__cond~212#1, main_#t~nondet60#1, main_~main____CPAchecker_TMP_2~46#1, main_~__tmp_218~0#1, main_~__VERIFIER_assert__cond~217#1, main_~__tmp_217~0#1, main_~__VERIFIER_assert__cond~216#1, main_#t~nondet61#1, main_~main____CPAchecker_TMP_2~47#1, main_~__tmp_222~0#1, main_~__VERIFIER_assert__cond~221#1, main_~__tmp_221~0#1, main_~__VERIFIER_assert__cond~220#1, main_#t~nondet62#1, main_~main____CPAchecker_TMP_2~48#1, main_~__tmp_226~0#1, main_~__VERIFIER_assert__cond~225#1, main_~__tmp_225~0#1, main_~__VERIFIER_assert__cond~224#1, main_#t~nondet63#1, main_~main____CPAchecker_TMP_2~49#1, main_~__tmp_230~0#1, main_~__VERIFIER_assert__cond~229#1, main_~__tmp_229~0#1, main_~__VERIFIER_assert__cond~228#1, main_#t~nondet64#1, main_~main____CPAchecker_TMP_2~50#1, main_~__tmp_234~0#1, main_~__VERIFIER_assert__cond~233#1, main_~__tmp_233~0#1, main_~__VERIFIER_assert__cond~232#1, main_#t~nondet65#1, main_~main____CPAchecker_TMP_2~51#1, main_~__tmp_238~0#1, main_~__VERIFIER_assert__cond~237#1, main_~__tmp_237~0#1, main_~__VERIFIER_assert__cond~236#1, main_#t~nondet66#1, main_~main____CPAchecker_TMP_2~52#1, main_~__tmp_242~0#1, main_~__VERIFIER_assert__cond~241#1, main_~__tmp_241~0#1, main_~__VERIFIER_assert__cond~240#1, main_#t~nondet67#1, main_~main____CPAchecker_TMP_2~53#1, main_~__tmp_246~0#1, main_~__VERIFIER_assert__cond~245#1, main_~__tmp_245~0#1, main_~__VERIFIER_assert__cond~244#1, main_#t~nondet68#1, main_~main____CPAchecker_TMP_2~54#1, main_~__tmp_250~0#1, main_~__VERIFIER_assert__cond~249#1, main_~__tmp_249~0#1, main_~__VERIFIER_assert__cond~248#1, main_#t~nondet69#1, main_~main____CPAchecker_TMP_2~55#1, main_~__tmp_254~0#1, main_~__VERIFIER_assert__cond~253#1, main_~__tmp_253~0#1, main_~__VERIFIER_assert__cond~252#1, main_#t~nondet70#1, main_~main____CPAchecker_TMP_2~56#1, main_~__tmp_258~0#1, main_~__VERIFIER_assert__cond~257#1, main_~__tmp_257~0#1, main_~__VERIFIER_assert__cond~256#1, main_#t~nondet71#1, main_~main____CPAchecker_TMP_2~57#1, main_~__tmp_262~0#1, main_~__VERIFIER_assert__cond~261#1, main_~__tmp_261~0#1, main_~__VERIFIER_assert__cond~260#1, main_#t~nondet72#1, main_~main____CPAchecker_TMP_2~58#1, main_~__tmp_266~0#1, main_~__VERIFIER_assert__cond~265#1, main_~__tmp_265~0#1, main_~__VERIFIER_assert__cond~264#1, main_#t~nondet73#1, main_~main____CPAchecker_TMP_2~59#1, main_~__tmp_270~0#1, main_~__VERIFIER_assert__cond~269#1, main_~__tmp_269~0#1, main_~__VERIFIER_assert__cond~268#1, main_#t~nondet74#1, main_~__tmp_276~0#1, main_~__VERIFIER_assert__cond~275#1, main_~__tmp_275~0#1, main_~__VERIFIER_assert__cond~274#1, main_#t~nondet75#1, main_#t~nondet76#1, main_~__tmp_280~0#1, main_~__VERIFIER_assert__cond~279#1, main_~__tmp_279~0#1, main_~__VERIFIER_assert__cond~278#1, main_~main____CPAchecker_TMP_5~3#1, main_~__tmp_278~0#1, main_~__VERIFIER_assert__cond~277#1, main_~__tmp_277~0#1, main_~__VERIFIER_assert__cond~276#1, main_~main____CPAchecker_TMP_7~3#1, main_~__tmp_282~0#1, main_~__VERIFIER_assert__cond~281#1, main_~__tmp_281~0#1, main_~__VERIFIER_assert__cond~280#1, main_~main____CPAchecker_TMP_4~3#1, main_#t~nondet77#1, main_~__tmp_284~0#1, main_~__VERIFIER_assert__cond~283#1, main_~__tmp_283~0#1, main_~__VERIFIER_assert__cond~282#1, main_~main____CPAchecker_TMP_6~3#1, main_~main____CPAchecker_TMP_3~3#1, main_~main____CPAchecker_TMP_2~60#1, main_~__tmp_274~0#1, main_~__VERIFIER_assert__cond~273#1, main_~__tmp_273~0#1, main_~__VERIFIER_assert__cond~272#1, main_~main____CPAchecker_TMP_0~60#1, main_~main____CPAchecker_TMP_1~59#1, main_~__tmp_272~0#1, main_~__VERIFIER_assert__cond~271#1, main_~__tmp_271~0#1, main_~__VERIFIER_assert__cond~270#1, main_~main____CPAchecker_TMP_0~59#1, main_~main____CPAchecker_TMP_1~58#1, main_~__tmp_268~0#1, main_~__VERIFIER_assert__cond~267#1, main_~__tmp_267~0#1, main_~__VERIFIER_assert__cond~266#1, main_~main____CPAchecker_TMP_0~58#1, main_~main____CPAchecker_TMP_1~57#1, main_~__tmp_264~0#1, main_~__VERIFIER_assert__cond~263#1, main_~__tmp_263~0#1, main_~__VERIFIER_assert__cond~262#1, main_~main____CPAchecker_TMP_0~57#1, main_~main____CPAchecker_TMP_1~56#1, main_~__tmp_260~0#1, main_~__VERIFIER_assert__cond~259#1, main_~__tmp_259~0#1, main_~__VERIFIER_assert__cond~258#1, main_~main____CPAchecker_TMP_0~56#1, main_~main____CPAchecker_TMP_1~55#1, main_~__tmp_256~0#1, main_~__VERIFIER_assert__cond~255#1, main_~__tmp_255~0#1, main_~__VERIFIER_assert__cond~254#1, main_~main____CPAchecker_TMP_0~55#1, main_~main____CPAchecker_TMP_1~54#1, main_~__tmp_252~0#1, main_~__VERIFIER_assert__cond~251#1, main_~__tmp_251~0#1, main_~__VERIFIER_assert__cond~250#1, main_~main____CPAchecker_TMP_0~54#1, main_~main____CPAchecker_TMP_1~53#1, main_~__tmp_248~0#1, main_~__VERIFIER_assert__cond~247#1, main_~__tmp_247~0#1, main_~__VERIFIER_assert__cond~246#1, main_~main____CPAchecker_TMP_0~53#1, main_~main____CPAchecker_TMP_1~52#1, main_~__tmp_244~0#1, main_~__VERIFIER_assert__cond~243#1, main_~__tmp_243~0#1, main_~__VERIFIER_assert__cond~242#1, main_~main____CPAchecker_TMP_0~52#1, main_~main____CPAchecker_TMP_1~51#1, main_~__tmp_240~0#1, main_~__VERIFIER_assert__cond~239#1, main_~__tmp_239~0#1, main_~__VERIFIER_assert__cond~238#1, main_~main____CPAchecker_TMP_0~51#1, main_~main____CPAchecker_TMP_1~50#1, main_~__tmp_236~0#1, main_~__VERIFIER_assert__cond~235#1, main_~__tmp_235~0#1, main_~__VERIFIER_assert__cond~234#1, main_~main____CPAchecker_TMP_0~50#1, main_~main____CPAchecker_TMP_1~49#1, main_~__tmp_232~0#1, main_~__VERIFIER_assert__cond~231#1, main_~__tmp_231~0#1, main_~__VERIFIER_assert__cond~230#1, main_~main____CPAchecker_TMP_0~49#1, main_~main____CPAchecker_TMP_1~48#1, main_~__tmp_228~0#1, main_~__VERIFIER_assert__cond~227#1, main_~__tmp_227~0#1, main_~__VERIFIER_assert__cond~226#1, main_~main____CPAchecker_TMP_0~48#1, main_~main____CPAchecker_TMP_1~47#1, main_~__tmp_224~0#1, main_~__VERIFIER_assert__cond~223#1, main_~__tmp_223~0#1, main_~__VERIFIER_assert__cond~222#1, main_~main____CPAchecker_TMP_0~47#1, main_~main____CPAchecker_TMP_1~46#1, main_~__tmp_220~0#1, main_~__VERIFIER_assert__cond~219#1, main_~__tmp_219~0#1, main_~__VERIFIER_assert__cond~218#1, main_~main____CPAchecker_TMP_0~46#1, main_~main____CPAchecker_TMP_1~45#1, main_~__tmp_216~0#1, main_~__VERIFIER_assert__cond~215#1, main_~__tmp_215~0#1, main_~__VERIFIER_assert__cond~214#1, main_~main____CPAchecker_TMP_0~45#1, main_~main____CPAchecker_TMP_1~44#1, main_~__tmp_212~0#1, main_~__VERIFIER_assert__cond~211#1, main_~__tmp_211~0#1, main_~__VERIFIER_assert__cond~210#1, main_~main____CPAchecker_TMP_0~44#1, main_~main____CPAchecker_TMP_1~43#1, main_~__tmp_208~0#1, main_~__VERIFIER_assert__cond~207#1, main_~__tmp_207~0#1, main_~__VERIFIER_assert__cond~206#1, main_~main____CPAchecker_TMP_0~43#1, main_~main____CPAchecker_TMP_1~42#1, main_~__tmp_204~0#1, main_~__VERIFIER_assert__cond~203#1, main_~__tmp_203~0#1, main_~__VERIFIER_assert__cond~202#1, main_~main____CPAchecker_TMP_0~42#1, main_~main____CPAchecker_TMP_1~41#1, main_~__tmp_200~0#1, main_~__VERIFIER_assert__cond~199#1, main_~__tmp_199~0#1, main_~__VERIFIER_assert__cond~198#1, main_~main____CPAchecker_TMP_0~41#1, main_~main____CPAchecker_TMP_1~40#1, main_~__tmp_196~0#1, main_~__VERIFIER_assert__cond~195#1, main_~__tmp_195~0#1, main_~__VERIFIER_assert__cond~194#1, main_~main____CPAchecker_TMP_0~40#1, main_~main____CPAchecker_TMP_1~39#1, main_~__tmp_192~0#1, main_~__VERIFIER_assert__cond~191#1, main_~__tmp_191~0#1, main_~__VERIFIER_assert__cond~190#1, main_~main____CPAchecker_TMP_0~39#1, main_~main____CPAchecker_TMP_1~38#1, main_~__tmp_188~0#1, main_~__VERIFIER_assert__cond~187#1, main_~__tmp_187~0#1, main_~__VERIFIER_assert__cond~186#1, main_~main____CPAchecker_TMP_0~38#1, main_~main____CPAchecker_TMP_1~37#1, main_~__tmp_184~0#1, main_~__VERIFIER_assert__cond~183#1, main_~__tmp_183~0#1, main_~__VERIFIER_assert__cond~182#1, main_~main____CPAchecker_TMP_0~37#1, main_~main____CPAchecker_TMP_1~36#1, main_~__tmp_180~0#1, main_~__VERIFIER_assert__cond~179#1, main_~__tmp_179~0#1, main_~__VERIFIER_assert__cond~178#1, main_~main____CPAchecker_TMP_0~36#1, main_~main____CPAchecker_TMP_1~35#1, main_~__tmp_176~0#1, main_~__VERIFIER_assert__cond~175#1, main_~__tmp_175~0#1, main_~__VERIFIER_assert__cond~174#1, main_~main____CPAchecker_TMP_0~35#1, main_~main____CPAchecker_TMP_1~34#1, main_~__tmp_172~0#1, main_~__VERIFIER_assert__cond~171#1, main_~__tmp_171~0#1, main_~__VERIFIER_assert__cond~170#1, main_~main____CPAchecker_TMP_0~34#1, main_~main____CPAchecker_TMP_1~33#1, main_~__tmp_168~0#1, main_~__VERIFIER_assert__cond~167#1, main_~__tmp_167~0#1, main_~__VERIFIER_assert__cond~166#1, main_~main____CPAchecker_TMP_0~33#1, main_~main____CPAchecker_TMP_1~32#1, main_~__tmp_164~0#1, main_~__VERIFIER_assert__cond~163#1, main_~__tmp_163~0#1, main_~__VERIFIER_assert__cond~162#1, main_~main____CPAchecker_TMP_0~32#1, main_~main____CPAchecker_TMP_1~31#1, main_~__tmp_160~0#1, main_~__VERIFIER_assert__cond~159#1, main_~__tmp_159~0#1, main_~__VERIFIER_assert__cond~158#1, main_~main____CPAchecker_TMP_0~31#1, main_~main____CPAchecker_TMP_1~30#1, main_~__tmp_156~0#1, main_~__VERIFIER_assert__cond~155#1, main_~__tmp_155~0#1, main_~__VERIFIER_assert__cond~154#1, main_~main____CPAchecker_TMP_0~30#1, main_~main____CPAchecker_TMP_1~29#1, main_~__tmp_152~0#1, main_~__VERIFIER_assert__cond~151#1, main_~__tmp_151~0#1, main_~__VERIFIER_assert__cond~150#1, main_~main____CPAchecker_TMP_0~29#1, main_~main____CPAchecker_TMP_1~28#1, main_~__tmp_148~0#1, main_~__VERIFIER_assert__cond~147#1, main_~__tmp_147~0#1, main_~__VERIFIER_assert__cond~146#1, main_~main____CPAchecker_TMP_0~28#1, main_~main____CPAchecker_TMP_1~27#1, main_~__tmp_144~0#1, main_~__VERIFIER_assert__cond~143#1, main_~__tmp_143~0#1, main_~__VERIFIER_assert__cond~142#1, main_~main____CPAchecker_TMP_0~27#1, main_~main____CPAchecker_TMP_1~26#1, main_~__tmp_140~0#1, main_~__VERIFIER_assert__cond~139#1, main_~__tmp_139~0#1, main_~__VERIFIER_assert__cond~138#1, main_~main____CPAchecker_TMP_0~26#1, main_~main____CPAchecker_TMP_1~25#1, main_~__tmp_136~0#1, main_~__VERIFIER_assert__cond~135#1, main_~__tmp_135~0#1, main_~__VERIFIER_assert__cond~134#1, main_~main____CPAchecker_TMP_0~25#1, main_~main____CPAchecker_TMP_1~24#1, main_~__tmp_132~0#1, main_~__VERIFIER_assert__cond~131#1, main_~__tmp_131~0#1, main_~__VERIFIER_assert__cond~130#1, main_~main____CPAchecker_TMP_0~24#1, main_~main____CPAchecker_TMP_1~23#1, main_~__tmp_128~0#1, main_~__VERIFIER_assert__cond~127#1, main_~__tmp_127~0#1, main_~__VERIFIER_assert__cond~126#1, main_~main____CPAchecker_TMP_0~23#1, main_~main____CPAchecker_TMP_1~22#1, main_~__tmp_124~0#1, main_~__VERIFIER_assert__cond~123#1, main_~__tmp_123~0#1, main_~__VERIFIER_assert__cond~122#1, main_~main____CPAchecker_TMP_0~22#1, main_~main____CPAchecker_TMP_1~21#1, main_~__tmp_120~0#1, main_~__VERIFIER_assert__cond~119#1, main_~__tmp_119~0#1, main_~__VERIFIER_assert__cond~118#1, main_~main____CPAchecker_TMP_0~21#1, main_~main____CPAchecker_TMP_1~20#1, main_~__tmp_116~0#1, main_~__VERIFIER_assert__cond~115#1, main_~__tmp_115~0#1, main_~__VERIFIER_assert__cond~114#1, main_~main____CPAchecker_TMP_0~20#1, main_~main____CPAchecker_TMP_1~19#1, main_~__tmp_112~0#1, main_~__VERIFIER_assert__cond~111#1, main_~__tmp_111~0#1, main_~__VERIFIER_assert__cond~110#1, main_~main____CPAchecker_TMP_0~19#1, main_~main____CPAchecker_TMP_1~18#1, main_~__tmp_108~0#1, main_~__VERIFIER_assert__cond~107#1, main_~__tmp_107~0#1, main_~__VERIFIER_assert__cond~106#1, main_~main____CPAchecker_TMP_0~18#1, main_~main____CPAchecker_TMP_1~17#1, main_~__tmp_104~0#1, main_~__VERIFIER_assert__cond~103#1, main_~__tmp_103~0#1, main_~__VERIFIER_assert__cond~102#1, main_~main____CPAchecker_TMP_0~17#1, main_~main____CPAchecker_TMP_1~16#1, main_~__tmp_100~0#1, main_~__VERIFIER_assert__cond~99#1, main_~__tmp_99~0#1, main_~__VERIFIER_assert__cond~98#1, main_~main____CPAchecker_TMP_0~16#1, main_~main____CPAchecker_TMP_1~15#1, main_~__tmp_96~0#1, main_~__VERIFIER_assert__cond~95#1, main_~__tmp_95~0#1, main_~__VERIFIER_assert__cond~94#1, main_~main____CPAchecker_TMP_0~15#1, main_~main____CPAchecker_TMP_1~14#1, main_~__tmp_92~0#1, main_~__VERIFIER_assert__cond~91#1, main_~__tmp_91~0#1, main_~__VERIFIER_assert__cond~90#1, main_~main____CPAchecker_TMP_0~14#1, main_~main____CPAchecker_TMP_1~13#1, main_~__tmp_88~0#1, main_~__VERIFIER_assert__cond~87#1, main_~__tmp_87~0#1, main_~__VERIFIER_assert__cond~86#1, main_~main____CPAchecker_TMP_0~13#1, main_~main____CPAchecker_TMP_1~12#1, main_~__tmp_84~0#1, main_~__VERIFIER_assert__cond~83#1, main_~__tmp_83~0#1, main_~__VERIFIER_assert__cond~82#1, main_~main____CPAchecker_TMP_0~12#1, main_~main____CPAchecker_TMP_1~11#1, main_~__tmp_80~0#1, main_~__VERIFIER_assert__cond~79#1, main_~__tmp_79~0#1, main_~__VERIFIER_assert__cond~78#1, main_~main____CPAchecker_TMP_0~11#1, main_~main____CPAchecker_TMP_1~10#1, main_~__tmp_76~0#1, main_~__VERIFIER_assert__cond~75#1, main_~__tmp_75~0#1, main_~__VERIFIER_assert__cond~74#1, main_~main____CPAchecker_TMP_0~10#1, main_~main____CPAchecker_TMP_1~9#1, main_~__tmp_72~0#1, main_~__VERIFIER_assert__cond~71#1, main_~__tmp_71~0#1, main_~__VERIFIER_assert__cond~70#1, main_~main____CPAchecker_TMP_0~9#1, main_~main____CPAchecker_TMP_1~8#1, main_~__tmp_68~0#1, main_~__VERIFIER_assert__cond~67#1, main_~__tmp_67~0#1, main_~__VERIFIER_assert__cond~66#1, main_~main____CPAchecker_TMP_0~8#1, main_~main____CPAchecker_TMP_1~7#1, main_~__tmp_64~0#1, main_~__VERIFIER_assert__cond~63#1, main_~__tmp_63~0#1, main_~__VERIFIER_assert__cond~62#1, main_~main____CPAchecker_TMP_0~7#1, main_~main____CPAchecker_TMP_1~6#1, main_~__tmp_60~0#1, main_~__VERIFIER_assert__cond~59#1, main_~__tmp_59~0#1, main_~__VERIFIER_assert__cond~58#1, main_~main____CPAchecker_TMP_0~6#1, main_~main____CPAchecker_TMP_1~5#1, main_~__tmp_56~0#1, main_~__VERIFIER_assert__cond~55#1, main_~__tmp_55~0#1, main_~__VERIFIER_assert__cond~54#1, main_~main____CPAchecker_TMP_0~5#1, main_~main____CPAchecker_TMP_1~4#1, main_~__tmp_52~0#1, main_~__VERIFIER_assert__cond~51#1, main_~__tmp_51~0#1, main_~__VERIFIER_assert__cond~50#1, main_~main____CPAchecker_TMP_0~4#1, main_~main____CPAchecker_TMP_1~3#1, main_~__tmp_48~0#1, main_~__VERIFIER_assert__cond~47#1, main_~__tmp_47~0#1, main_~__VERIFIER_assert__cond~46#1, main_~main____CPAchecker_TMP_0~3#1, main_~main____CPAchecker_TMP_1~2#1, main_~__tmp_44~0#1, main_~__VERIFIER_assert__cond~43#1, main_~__tmp_43~0#1, main_~__VERIFIER_assert__cond~42#1, main_~main____CPAchecker_TMP_0~2#1, main_~main____CPAchecker_TMP_1~1#1, main_~__tmp_40~0#1, main_~__VERIFIER_assert__cond~39#1, main_~__tmp_39~0#1, main_~__VERIFIER_assert__cond~38#1, main_~main____CPAchecker_TMP_0~1#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_36~0#1, main_~__VERIFIER_assert__cond~35#1, main_~__tmp_35~0#1, main_~__VERIFIER_assert__cond~34#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__tagbuf_len~0#1, main_~main__t~0#1;assume { :end_inline_main } true; [2025-02-07 20:16:09,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3633: havoc main_~main____CPAchecker_TMP_2~44#1;havoc main_~__tmp_210~0#1, main_~__VERIFIER_assert__cond~209#1;havoc main_~__tmp_209~0#1, main_~__VERIFIER_assert__cond~208#1; [2025-02-07 20:16:09,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1321: havoc main_~main____CPAchecker_TMP_2~10#1;havoc main_~__tmp_74~0#1, main_~__VERIFIER_assert__cond~73#1;havoc main_~__tmp_73~0#1, main_~__VERIFIER_assert__cond~72#1; [2025-02-07 20:16:09,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4559: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~main____CPAchecker_TMP_1~57#1;havoc main_~__tmp_264~0#1, main_~__VERIFIER_assert__cond~263#1;havoc main_~__tmp_263~0#1, main_~__VERIFIER_assert__cond~262#1; [2025-02-07 20:16:09,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: havoc main_~main____CPAchecker_TMP_4~1#1; [2025-02-07 20:16:09,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2247: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~main____CPAchecker_TMP_1~23#1;havoc main_~__tmp_128~0#1, main_~__VERIFIER_assert__cond~127#1;havoc main_~__tmp_127~0#1, main_~__VERIFIER_assert__cond~126#1; [2025-02-07 20:16:09,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3701: havoc main_~main____CPAchecker_TMP_2~45#1;havoc main_~__tmp_214~0#1, main_~__VERIFIER_assert__cond~213#1;havoc main_~__tmp_213~0#1, main_~__VERIFIER_assert__cond~212#1; [2025-02-07 20:16:09,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: havoc main_~__tmp_30~0#1, main_~__VERIFIER_assert__cond~29#1;havoc main_~__tmp_29~0#1, main_~__VERIFIER_assert__cond~28#1;havoc main_~main____CPAchecker_TMP_6~0#1; [2025-02-07 20:16:09,473 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1389: havoc main_~main____CPAchecker_TMP_2~11#1;havoc main_~__tmp_78~0#1, main_~__VERIFIER_assert__cond~77#1;havoc main_~__tmp_77~0#1, main_~__VERIFIER_assert__cond~76#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4627: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~main____CPAchecker_TMP_1~58#1;havoc main_~__tmp_268~0#1, main_~__VERIFIER_assert__cond~267#1;havoc main_~__tmp_267~0#1, main_~__VERIFIER_assert__cond~266#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2315: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~main____CPAchecker_TMP_1~24#1;havoc main_~__tmp_132~0#1, main_~__VERIFIER_assert__cond~131#1;havoc main_~__tmp_131~0#1, main_~__VERIFIER_assert__cond~130#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3769: havoc main_~main____CPAchecker_TMP_2~46#1;havoc main_~__tmp_218~0#1, main_~__VERIFIER_assert__cond~217#1;havoc main_~__tmp_217~0#1, main_~__VERIFIER_assert__cond~216#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1457: havoc main_~main____CPAchecker_TMP_2~12#1;havoc main_~__tmp_82~0#1, main_~__VERIFIER_assert__cond~81#1;havoc main_~__tmp_81~0#1, main_~__VERIFIER_assert__cond~80#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: havoc main_~main____CPAchecker_TMP_3~2#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2383: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~main____CPAchecker_TMP_1~25#1;havoc main_~__tmp_136~0#1, main_~__VERIFIER_assert__cond~135#1;havoc main_~__tmp_135~0#1, main_~__VERIFIER_assert__cond~134#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3837: havoc main_~main____CPAchecker_TMP_2~47#1;havoc main_~__tmp_222~0#1, main_~__VERIFIER_assert__cond~221#1;havoc main_~__tmp_221~0#1, main_~__VERIFIER_assert__cond~220#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: havoc main_~main____CPAchecker_TMP_2~13#1;havoc main_~__tmp_86~0#1, main_~__VERIFIER_assert__cond~85#1;havoc main_~__tmp_85~0#1, main_~__VERIFIER_assert__cond~84#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~main____CPAchecker_TMP_1~26#1;havoc main_~__tmp_140~0#1, main_~__VERIFIER_assert__cond~139#1;havoc main_~__tmp_139~0#1, main_~__VERIFIER_assert__cond~138#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3905: havoc main_~main____CPAchecker_TMP_2~48#1;havoc main_~__tmp_226~0#1, main_~__VERIFIER_assert__cond~225#1;havoc main_~__tmp_225~0#1, main_~__VERIFIER_assert__cond~224#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1593: havoc main_~main____CPAchecker_TMP_2~14#1;havoc main_~__tmp_90~0#1, main_~__VERIFIER_assert__cond~89#1;havoc main_~__tmp_89~0#1, main_~__VERIFIER_assert__cond~88#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~main____CPAchecker_TMP_1~27#1;havoc main_~__tmp_144~0#1, main_~__VERIFIER_assert__cond~143#1;havoc main_~__tmp_143~0#1, main_~__VERIFIER_assert__cond~142#1; [2025-02-07 20:16:09,474 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L405: havoc main_~main____CPAchecker_TMP_4~2#1; [2025-02-07 20:16:09,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3973: havoc main_~main____CPAchecker_TMP_2~49#1;havoc main_~__tmp_230~0#1, main_~__VERIFIER_assert__cond~229#1;havoc main_~__tmp_229~0#1, main_~__VERIFIER_assert__cond~228#1; [2025-02-07 20:16:09,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4898: havoc main_~__tmp_284~0#1, main_~__VERIFIER_assert__cond~283#1;havoc main_~__tmp_283~0#1, main_~__VERIFIER_assert__cond~282#1;havoc main_~main____CPAchecker_TMP_6~3#1; [2025-02-07 20:16:09,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1661: havoc main_~main____CPAchecker_TMP_2~15#1;havoc main_~__tmp_94~0#1, main_~__VERIFIER_assert__cond~93#1;havoc main_~__tmp_93~0#1, main_~__VERIFIER_assert__cond~92#1; [2025-02-07 20:16:09,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4767: havoc main_~main____CPAchecker_TMP_3~3#1; [2025-02-07 20:16:09,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~main____CPAchecker_TMP_1~28#1;havoc main_~__tmp_148~0#1, main_~__VERIFIER_assert__cond~147#1;havoc main_~__tmp_147~0#1, main_~__VERIFIER_assert__cond~146#1; [2025-02-07 20:16:09,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4041: havoc main_~main____CPAchecker_TMP_2~50#1;havoc main_~__tmp_234~0#1, main_~__VERIFIER_assert__cond~233#1;havoc main_~__tmp_233~0#1, main_~__VERIFIER_assert__cond~232#1; [2025-02-07 20:16:09,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1729: havoc main_~main____CPAchecker_TMP_2~16#1;havoc main_~__tmp_98~0#1, main_~__VERIFIER_assert__cond~97#1;havoc main_~__tmp_97~0#1, main_~__VERIFIER_assert__cond~96#1; [2025-02-07 20:16:09,475 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2655: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~main____CPAchecker_TMP_1~29#1;havoc main_~__tmp_152~0#1, main_~__VERIFIER_assert__cond~151#1;havoc main_~__tmp_151~0#1, main_~__VERIFIER_assert__cond~150#1; [2025-02-07 20:16:09,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4109: havoc main_~main____CPAchecker_TMP_2~51#1;havoc main_~__tmp_238~0#1, main_~__VERIFIER_assert__cond~237#1;havoc main_~__tmp_237~0#1, main_~__VERIFIER_assert__cond~236#1; [2025-02-07 20:16:09,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1797: havoc main_~main____CPAchecker_TMP_2~17#1;havoc main_~__tmp_102~0#1, main_~__VERIFIER_assert__cond~101#1;havoc main_~__tmp_101~0#1, main_~__VERIFIER_assert__cond~100#1; [2025-02-07 20:16:09,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4771: havoc main_~main____CPAchecker_TMP_4~3#1; [2025-02-07 20:16:09,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~main____CPAchecker_TMP_1~30#1;havoc main_~__tmp_156~0#1, main_~__VERIFIER_assert__cond~155#1;havoc main_~__tmp_155~0#1, main_~__VERIFIER_assert__cond~154#1; [2025-02-07 20:16:09,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4177: havoc main_~main____CPAchecker_TMP_2~52#1;havoc main_~__tmp_242~0#1, main_~__VERIFIER_assert__cond~241#1;havoc main_~__tmp_241~0#1, main_~__VERIFIER_assert__cond~240#1; [2025-02-07 20:16:09,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865: havoc main_~main____CPAchecker_TMP_2~18#1;havoc main_~__tmp_106~0#1, main_~__VERIFIER_assert__cond~105#1;havoc main_~__tmp_105~0#1, main_~__VERIFIER_assert__cond~104#1; [2025-02-07 20:16:09,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~main____CPAchecker_TMP_1~31#1;havoc main_~__tmp_160~0#1, main_~__VERIFIER_assert__cond~159#1;havoc main_~__tmp_159~0#1, main_~__VERIFIER_assert__cond~158#1; [2025-02-07 20:16:09,476 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4245: havoc main_~main____CPAchecker_TMP_2~53#1;havoc main_~__tmp_246~0#1, main_~__VERIFIER_assert__cond~245#1;havoc main_~__tmp_245~0#1, main_~__VERIFIER_assert__cond~244#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1933: havoc main_~main____CPAchecker_TMP_2~19#1;havoc main_~__tmp_110~0#1, main_~__VERIFIER_assert__cond~109#1;havoc main_~__tmp_109~0#1, main_~__VERIFIER_assert__cond~108#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~main____CPAchecker_TMP_1~32#1;havoc main_~__tmp_164~0#1, main_~__VERIFIER_assert__cond~163#1;havoc main_~__tmp_163~0#1, main_~__VERIFIER_assert__cond~162#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4313: havoc main_~main____CPAchecker_TMP_2~54#1;havoc main_~__tmp_250~0#1, main_~__VERIFIER_assert__cond~249#1;havoc main_~__tmp_249~0#1, main_~__VERIFIER_assert__cond~248#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2001: havoc main_~main____CPAchecker_TMP_2~20#1;havoc main_~__tmp_114~0#1, main_~__VERIFIER_assert__cond~113#1;havoc main_~__tmp_113~0#1, main_~__VERIFIER_assert__cond~112#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~main____CPAchecker_TMP_1~33#1;havoc main_~__tmp_168~0#1, main_~__VERIFIER_assert__cond~167#1;havoc main_~__tmp_167~0#1, main_~__VERIFIER_assert__cond~166#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4381: havoc main_~main____CPAchecker_TMP_2~55#1;havoc main_~__tmp_254~0#1, main_~__VERIFIER_assert__cond~253#1;havoc main_~__tmp_253~0#1, main_~__VERIFIER_assert__cond~252#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2069: havoc main_~main____CPAchecker_TMP_2~21#1;havoc main_~__tmp_118~0#1, main_~__VERIFIER_assert__cond~117#1;havoc main_~__tmp_117~0#1, main_~__VERIFIER_assert__cond~116#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2995: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~main____CPAchecker_TMP_1~34#1;havoc main_~__tmp_172~0#1, main_~__VERIFIER_assert__cond~171#1;havoc main_~__tmp_171~0#1, main_~__VERIFIER_assert__cond~170#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_36~0#1, main_~__VERIFIER_assert__cond~35#1;havoc main_~__tmp_35~0#1, main_~__VERIFIER_assert__cond~34#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4449: havoc main_~main____CPAchecker_TMP_2~56#1;havoc main_~__tmp_258~0#1, main_~__VERIFIER_assert__cond~257#1;havoc main_~__tmp_257~0#1, main_~__VERIFIER_assert__cond~256#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2137: havoc main_~main____CPAchecker_TMP_2~22#1;havoc main_~__tmp_122~0#1, main_~__VERIFIER_assert__cond~121#1;havoc main_~__tmp_121~0#1, main_~__VERIFIER_assert__cond~120#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~main____CPAchecker_TMP_7~0#1;havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~main____CPAchecker_TMP_1~35#1;havoc main_~__tmp_176~0#1, main_~__VERIFIER_assert__cond~175#1;havoc main_~__tmp_175~0#1, main_~__VERIFIER_assert__cond~174#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~__tmp_40~0#1, main_~__VERIFIER_assert__cond~39#1;havoc main_~__tmp_39~0#1, main_~__VERIFIER_assert__cond~38#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4517: havoc main_~main____CPAchecker_TMP_2~57#1;havoc main_~__tmp_262~0#1, main_~__VERIFIER_assert__cond~261#1;havoc main_~__tmp_261~0#1, main_~__VERIFIER_assert__cond~260#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2205: havoc main_~main____CPAchecker_TMP_2~23#1;havoc main_~__tmp_126~0#1, main_~__VERIFIER_assert__cond~125#1;havoc main_~__tmp_125~0#1, main_~__VERIFIER_assert__cond~124#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3131: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~main____CPAchecker_TMP_1~36#1;havoc main_~__tmp_180~0#1, main_~__VERIFIER_assert__cond~179#1;havoc main_~__tmp_179~0#1, main_~__VERIFIER_assert__cond~178#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L819: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~main____CPAchecker_TMP_1~2#1;havoc main_~__tmp_44~0#1, main_~__VERIFIER_assert__cond~43#1;havoc main_~__tmp_43~0#1, main_~__VERIFIER_assert__cond~42#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4585: havoc main_~main____CPAchecker_TMP_2~58#1;havoc main_~__tmp_266~0#1, main_~__VERIFIER_assert__cond~265#1;havoc main_~__tmp_265~0#1, main_~__VERIFIER_assert__cond~264#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2273: havoc main_~main____CPAchecker_TMP_2~24#1;havoc main_~__tmp_130~0#1, main_~__VERIFIER_assert__cond~129#1;havoc main_~__tmp_129~0#1, main_~__VERIFIER_assert__cond~128#1; [2025-02-07 20:16:09,478 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3199: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~main____CPAchecker_TMP_1~37#1;havoc main_~__tmp_184~0#1, main_~__VERIFIER_assert__cond~183#1;havoc main_~__tmp_183~0#1, main_~__VERIFIER_assert__cond~182#1; [2025-02-07 20:16:09,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 20:16:09,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L887: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~main____CPAchecker_TMP_1~3#1;havoc main_~__tmp_48~0#1, main_~__VERIFIER_assert__cond~47#1;havoc main_~__tmp_47~0#1, main_~__VERIFIER_assert__cond~46#1; [2025-02-07 20:16:09,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4653: havoc main_~main____CPAchecker_TMP_2~59#1;havoc main_~__tmp_270~0#1, main_~__VERIFIER_assert__cond~269#1;havoc main_~__tmp_269~0#1, main_~__VERIFIER_assert__cond~268#1; [2025-02-07 20:16:09,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2341: havoc main_~main____CPAchecker_TMP_2~25#1;havoc main_~__tmp_134~0#1, main_~__VERIFIER_assert__cond~133#1;havoc main_~__tmp_133~0#1, main_~__VERIFIER_assert__cond~132#1; [2025-02-07 20:16:09,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc main_~__tmp_34~0#1, main_~__VERIFIER_assert__cond~33#1;havoc main_~__tmp_33~0#1, main_~__VERIFIER_assert__cond~32#1;havoc main_~main____CPAchecker_TMP_6~2#1; [2025-02-07 20:16:09,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: havoc main_~main____CPAchecker_TMP_7~1#1;havoc main_~__tmp_20~0#1, main_~__VERIFIER_assert__cond~19#1;havoc main_~__tmp_19~0#1, main_~__VERIFIER_assert__cond~18#1; [2025-02-07 20:16:09,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3267: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~main____CPAchecker_TMP_1~38#1;havoc main_~__tmp_188~0#1, main_~__VERIFIER_assert__cond~187#1;havoc main_~__tmp_187~0#1, main_~__VERIFIER_assert__cond~186#1; [2025-02-07 20:16:09,479 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~main____CPAchecker_TMP_1~4#1;havoc main_~__tmp_52~0#1, main_~__VERIFIER_assert__cond~51#1;havoc main_~__tmp_51~0#1, main_~__VERIFIER_assert__cond~50#1; [2025-02-07 20:16:09,481 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409: havoc main_~main____CPAchecker_TMP_2~26#1;havoc main_~__tmp_138~0#1, main_~__VERIFIER_assert__cond~137#1;havoc main_~__tmp_137~0#1, main_~__VERIFIER_assert__cond~136#1; [2025-02-07 20:16:09,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3335: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~main____CPAchecker_TMP_1~39#1;havoc main_~__tmp_192~0#1, main_~__VERIFIER_assert__cond~191#1;havoc main_~__tmp_191~0#1, main_~__VERIFIER_assert__cond~190#1; [2025-02-07 20:16:09,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1023: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~main____CPAchecker_TMP_1~5#1;havoc main_~__tmp_56~0#1, main_~__VERIFIER_assert__cond~55#1;havoc main_~__tmp_55~0#1, main_~__VERIFIER_assert__cond~54#1; [2025-02-07 20:16:09,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477: havoc main_~main____CPAchecker_TMP_2~27#1;havoc main_~__tmp_142~0#1, main_~__VERIFIER_assert__cond~141#1;havoc main_~__tmp_141~0#1, main_~__VERIFIER_assert__cond~140#1; [2025-02-07 20:16:09,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3403: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~main____CPAchecker_TMP_1~40#1;havoc main_~__tmp_196~0#1, main_~__VERIFIER_assert__cond~195#1;havoc main_~__tmp_195~0#1, main_~__VERIFIER_assert__cond~194#1; [2025-02-07 20:16:09,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~main____CPAchecker_TMP_1~6#1;havoc main_~__tmp_60~0#1, main_~__VERIFIER_assert__cond~59#1;havoc main_~__tmp_59~0#1, main_~__VERIFIER_assert__cond~58#1; [2025-02-07 20:16:09,482 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: havoc main_~main____CPAchecker_TMP_2~28#1;havoc main_~__tmp_146~0#1, main_~__VERIFIER_assert__cond~145#1;havoc main_~__tmp_145~0#1, main_~__VERIFIER_assert__cond~144#1; [2025-02-07 20:16:09,656 INFO L? ?]: Removed 1673 outVars from TransFormulas that were not future-live. [2025-02-07 20:16:09,657 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:16:09,679 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:16:09,680 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:16:09,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:09 BoogieIcfgContainer [2025-02-07 20:16:09,680 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:16:09,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:16:09,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:16:09,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:16:09,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:16:06" (1/3) ... [2025-02-07 20:16:09,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9169778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:09, skipping insertion in model container [2025-02-07 20:16:09,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:16:07" (2/3) ... [2025-02-07 20:16:09,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9169778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:16:09, skipping insertion in model container [2025-02-07 20:16:09,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:09" (3/3) ... [2025-02-07 20:16:09,689 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2025-02-07 20:16:09,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:16:09,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.p+sep-reducer.c that has 1 procedures, 476 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-07 20:16:09,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:16:09,766 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;@7abb149f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:16:09,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-07 20:16:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 475 states, 444 states have (on average 1.9977477477477477) internal successors, (887), 474 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-07 20:16:09,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:09,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-07 20:16:09,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 2069595592, now seen corresponding path program 1 times [2025-02-07 20:16:09,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:09,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329045666] [2025-02-07 20:16:09,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:09,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:09,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-07 20:16:09,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-07 20:16:09,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:09,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329045666] [2025-02-07 20:16:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329045666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:10,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:10,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283035289] [2025-02-07 20:16:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:10,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:10,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:10,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:10,023 INFO L87 Difference]: Start difference. First operand has 475 states, 444 states have (on average 1.9977477477477477) internal successors, (887), 474 states have internal predecessors, (887), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:10,823 INFO L93 Difference]: Finished difference Result 477 states and 887 transitions. [2025-02-07 20:16:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:10,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-02-07 20:16:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:10,829 INFO L225 Difference]: With dead ends: 477 [2025-02-07 20:16:10,829 INFO L226 Difference]: Without dead ends: 293 [2025-02-07 20:16:10,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:10,833 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 630 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:10,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 684 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 20:16:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-07 20:16:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-02-07 20:16:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 278 states have (on average 1.0503597122302157) internal successors, (292), 292 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 292 transitions. [2025-02-07 20:16:10,858 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 292 transitions. Word has length 5 [2025-02-07 20:16:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:10,858 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 292 transitions. [2025-02-07 20:16:10,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 292 transitions. [2025-02-07 20:16:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-07 20:16:10,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:10,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-07 20:16:10,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:16:10,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:10,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:10,859 INFO L85 PathProgramCache]: Analyzing trace with hash -267046855, now seen corresponding path program 1 times [2025-02-07 20:16:10,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:10,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294985091] [2025-02-07 20:16:10,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:10,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:10,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-07 20:16:10,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-07 20:16:10,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:10,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:10,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:10,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294985091] [2025-02-07 20:16:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294985091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:10,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:16:10,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164385037] [2025-02-07 20:16:10,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:10,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:16:10,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:10,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:16:10,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:10,939 INFO L87 Difference]: Start difference. First operand 293 states and 292 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:11,269 INFO L93 Difference]: Finished difference Result 293 states and 292 transitions. [2025-02-07 20:16:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:11,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-07 20:16:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:11,270 INFO L225 Difference]: With dead ends: 293 [2025-02-07 20:16:11,270 INFO L226 Difference]: Without dead ends: 289 [2025-02-07 20:16:11,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:11,271 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 7 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:11,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 615 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:11,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-07 20:16:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-02-07 20:16:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 275 states have (on average 1.0472727272727274) internal successors, (288), 288 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 288 transitions. [2025-02-07 20:16:11,278 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 288 transitions. Word has length 6 [2025-02-07 20:16:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:11,279 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 288 transitions. [2025-02-07 20:16:11,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:11,279 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 288 transitions. [2025-02-07 20:16:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-07 20:16:11,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:11,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:11,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:16:11,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:11,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash -573258576, now seen corresponding path program 1 times [2025-02-07 20:16:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344201417] [2025-02-07 20:16:11,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:11,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:11,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-07 20:16:11,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-07 20:16:11,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:11,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:14,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:14,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344201417] [2025-02-07 20:16:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344201417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:14,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:14,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2025-02-07 20:16:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779152037] [2025-02-07 20:16:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:14,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-07 20:16:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:14,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-07 20:16:14,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2025-02-07 20:16:14,896 INFO L87 Difference]: Start difference. First operand 289 states and 288 transitions. Second operand has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:15,574 INFO L93 Difference]: Finished difference Result 289 states and 288 transitions. [2025-02-07 20:16:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-07 20:16:15,575 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 0 states have call successors, (0), 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 242 [2025-02-07 20:16:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:15,576 INFO L225 Difference]: With dead ends: 289 [2025-02-07 20:16:15,576 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 20:16:15,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2025-02-07 20:16:15,578 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:15,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 129 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:16:15,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 20:16:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-02-07 20:16:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 274 states have (on average 1.0437956204379562) internal successors, (286), 286 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 286 transitions. [2025-02-07 20:16:15,584 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 286 transitions. Word has length 242 [2025-02-07 20:16:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:15,585 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 286 transitions. [2025-02-07 20:16:15,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.8412698412698414) internal successors, (242), 63 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 286 transitions. [2025-02-07 20:16:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-07 20:16:15,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:15,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:15,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:16:15,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:15,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:15,588 INFO L85 PathProgramCache]: Analyzing trace with hash -591142340, now seen corresponding path program 1 times [2025-02-07 20:16:15,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:15,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276313498] [2025-02-07 20:16:15,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:15,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:15,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-07 20:16:15,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-07 20:16:15,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:15,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276313498] [2025-02-07 20:16:16,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276313498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:16,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:16,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294508329] [2025-02-07 20:16:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:16,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:16,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:16,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:16,124 INFO L87 Difference]: Start difference. First operand 287 states and 286 transitions. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:16,477 INFO L93 Difference]: Finished difference Result 287 states and 286 transitions. [2025-02-07 20:16:16,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:16,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-02-07 20:16:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:16,479 INFO L225 Difference]: With dead ends: 287 [2025-02-07 20:16:16,479 INFO L226 Difference]: Without dead ends: 285 [2025-02-07 20:16:16,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:16:16,480 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 483 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:16,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-07 20:16:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-02-07 20:16:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 273 states have (on average 1.0402930402930404) internal successors, (284), 284 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 284 transitions. [2025-02-07 20:16:16,485 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 284 transitions. Word has length 243 [2025-02-07 20:16:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:16,486 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 284 transitions. [2025-02-07 20:16:16,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 284 transitions. [2025-02-07 20:16:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-02-07 20:16:16,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:16,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:16,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:16:16,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:16,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1351455199, now seen corresponding path program 1 times [2025-02-07 20:16:16,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735469771] [2025-02-07 20:16:16,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:16,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-02-07 20:16:16,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-02-07 20:16:16,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:16,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:18,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:18,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735469771] [2025-02-07 20:16:18,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735469771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:18,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:18,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2025-02-07 20:16:18,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067433767] [2025-02-07 20:16:18,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:18,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-07 20:16:18,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:18,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-07 20:16:18,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=2137, Unknown=0, NotChecked=0, Total=4032 [2025-02-07 20:16:18,976 INFO L87 Difference]: Start difference. First operand 285 states and 284 transitions. Second operand has 64 states, 64 states have (on average 3.84375) internal successors, (246), 64 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:19,613 INFO L93 Difference]: Finished difference Result 285 states and 284 transitions. [2025-02-07 20:16:19,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-07 20:16:19,613 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.84375) internal successors, (246), 64 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-02-07 20:16:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:19,614 INFO L225 Difference]: With dead ends: 285 [2025-02-07 20:16:19,614 INFO L226 Difference]: Without dead ends: 283 [2025-02-07 20:16:19,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2025-02-07 20:16:19,616 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 84 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:19,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 111 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:16:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-07 20:16:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-02-07 20:16:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 272 states have (on average 1.036764705882353) internal successors, (282), 282 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 282 transitions. [2025-02-07 20:16:19,621 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 282 transitions. Word has length 246 [2025-02-07 20:16:19,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:19,621 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 282 transitions. [2025-02-07 20:16:19,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.84375) internal successors, (246), 64 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:19,622 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 282 transitions. [2025-02-07 20:16:19,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-07 20:16:19,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:19,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:19,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 20:16:19,624 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:19,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1054565390, now seen corresponding path program 1 times [2025-02-07 20:16:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427851768] [2025-02-07 20:16:19,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:19,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:19,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-07 20:16:19,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-07 20:16:19,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:19,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427851768] [2025-02-07 20:16:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427851768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:19,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067362266] [2025-02-07 20:16:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:19,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:19,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:19,929 INFO L87 Difference]: Start difference. First operand 283 states and 282 transitions. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:20,287 INFO L93 Difference]: Finished difference Result 283 states and 282 transitions. [2025-02-07 20:16:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:20,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-02-07 20:16:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:20,288 INFO L225 Difference]: With dead ends: 283 [2025-02-07 20:16:20,288 INFO L226 Difference]: Without dead ends: 281 [2025-02-07 20:16:20,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:16:20,289 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 337 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:20,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 79 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-07 20:16:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-02-07 20:16:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 271 states have (on average 1.033210332103321) internal successors, (280), 280 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 280 transitions. [2025-02-07 20:16:20,295 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 280 transitions. Word has length 247 [2025-02-07 20:16:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:20,296 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 280 transitions. [2025-02-07 20:16:20,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 280 transitions. [2025-02-07 20:16:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-07 20:16:20,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:20,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:20,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 20:16:20,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:20,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash -174906346, now seen corresponding path program 1 times [2025-02-07 20:16:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:20,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315327005] [2025-02-07 20:16:20,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:20,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-07 20:16:20,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-07 20:16:20,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:20,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:20,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315327005] [2025-02-07 20:16:20,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315327005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:20,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:20,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80391901] [2025-02-07 20:16:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:20,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:20,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:20,524 INFO L87 Difference]: Start difference. First operand 281 states and 280 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:20,659 INFO L93 Difference]: Finished difference Result 281 states and 280 transitions. [2025-02-07 20:16:20,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:20,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-02-07 20:16:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:20,662 INFO L225 Difference]: With dead ends: 281 [2025-02-07 20:16:20,663 INFO L226 Difference]: Without dead ends: 279 [2025-02-07 20:16:20,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:20,664 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 20 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:20,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 303 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-07 20:16:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-02-07 20:16:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 270 states have (on average 1.0296296296296297) internal successors, (278), 278 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 278 transitions. [2025-02-07 20:16:20,668 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 278 transitions. Word has length 249 [2025-02-07 20:16:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:20,669 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 278 transitions. [2025-02-07 20:16:20,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 278 transitions. [2025-02-07 20:16:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-02-07 20:16:20,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:20,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:20,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 20:16:20,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:20,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1127128643, now seen corresponding path program 1 times [2025-02-07 20:16:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:20,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118935264] [2025-02-07 20:16:20,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:20,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-02-07 20:16:20,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-02-07 20:16:20,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:20,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:20,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118935264] [2025-02-07 20:16:20,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118935264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:20,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:20,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:20,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028794271] [2025-02-07 20:16:20,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:20,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:20,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:20,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:20,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:20,835 INFO L87 Difference]: Start difference. First operand 279 states and 278 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:21,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:21,024 INFO L93 Difference]: Finished difference Result 279 states and 278 transitions. [2025-02-07 20:16:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:21,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-02-07 20:16:21,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:21,026 INFO L225 Difference]: With dead ends: 279 [2025-02-07 20:16:21,026 INFO L226 Difference]: Without dead ends: 275 [2025-02-07 20:16:21,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:21,026 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 5 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:21,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 555 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-07 20:16:21,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-02-07 20:16:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 267 states have (on average 1.0262172284644195) internal successors, (274), 274 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:21,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 274 transitions. [2025-02-07 20:16:21,031 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 274 transitions. Word has length 250 [2025-02-07 20:16:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:21,032 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 274 transitions. [2025-02-07 20:16:21,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:21,032 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 274 transitions. [2025-02-07 20:16:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-07 20:16:21,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:21,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:21,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 20:16:21,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:21,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:21,034 INFO L85 PathProgramCache]: Analyzing trace with hash -510245156, now seen corresponding path program 1 times [2025-02-07 20:16:21,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:21,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708999574] [2025-02-07 20:16:21,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:21,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:21,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-07 20:16:21,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-07 20:16:21,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:21,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:23,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:23,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708999574] [2025-02-07 20:16:23,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708999574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:23,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:23,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-02-07 20:16:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767133260] [2025-02-07 20:16:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:23,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-07 20:16:23,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:23,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-07 20:16:23,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-02-07 20:16:23,279 INFO L87 Difference]: Start difference. First operand 275 states and 274 transitions. Second operand has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:23,905 INFO L93 Difference]: Finished difference Result 275 states and 274 transitions. [2025-02-07 20:16:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-02-07 20:16:23,905 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-02-07 20:16:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:23,906 INFO L225 Difference]: With dead ends: 275 [2025-02-07 20:16:23,906 INFO L226 Difference]: Without dead ends: 273 [2025-02-07 20:16:23,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-02-07 20:16:23,907 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:23,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:16:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-07 20:16:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-02-07 20:16:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 266 states have (on average 1.0225563909774436) internal successors, (272), 272 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 272 transitions. [2025-02-07 20:16:23,911 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 272 transitions. Word has length 251 [2025-02-07 20:16:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:23,911 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 272 transitions. [2025-02-07 20:16:23,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 272 transitions. [2025-02-07 20:16:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-07 20:16:23,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:23,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:23,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:16:23,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:23,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:23,913 INFO L85 PathProgramCache]: Analyzing trace with hash -510228258, now seen corresponding path program 1 times [2025-02-07 20:16:23,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:23,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14263733] [2025-02-07 20:16:23,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:23,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-07 20:16:23,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-07 20:16:23,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:23,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:25,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14263733] [2025-02-07 20:16:25,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14263733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:25,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:25,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-02-07 20:16:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377579553] [2025-02-07 20:16:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:25,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-07 20:16:25,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:25,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-07 20:16:25,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-02-07 20:16:25,963 INFO L87 Difference]: Start difference. First operand 273 states and 272 transitions. Second operand has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:26,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:26,543 INFO L93 Difference]: Finished difference Result 273 states and 272 transitions. [2025-02-07 20:16:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-02-07 20:16:26,544 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-02-07 20:16:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:26,545 INFO L225 Difference]: With dead ends: 273 [2025-02-07 20:16:26,545 INFO L226 Difference]: Without dead ends: 271 [2025-02-07 20:16:26,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-02-07 20:16:26,547 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 120 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:26,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 65 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:16:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-07 20:16:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-07 20:16:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 265 states have (on average 1.0188679245283019) internal successors, (270), 270 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 270 transitions. [2025-02-07 20:16:26,555 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 270 transitions. Word has length 251 [2025-02-07 20:16:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:26,556 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 270 transitions. [2025-02-07 20:16:26,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 270 transitions. [2025-02-07 20:16:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-07 20:16:26,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:26,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:26,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 20:16:26,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:26,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash -509615555, now seen corresponding path program 1 times [2025-02-07 20:16:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381682583] [2025-02-07 20:16:26,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:26,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-07 20:16:26,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-07 20:16:26,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:26,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381682583] [2025-02-07 20:16:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381682583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:28,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-02-07 20:16:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138132851] [2025-02-07 20:16:28,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:28,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-07 20:16:28,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:28,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-07 20:16:28,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-02-07 20:16:28,709 INFO L87 Difference]: Start difference. First operand 271 states and 270 transitions. Second operand has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:29,256 INFO L93 Difference]: Finished difference Result 271 states and 270 transitions. [2025-02-07 20:16:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-02-07 20:16:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-02-07 20:16:29,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:29,258 INFO L225 Difference]: With dead ends: 271 [2025-02-07 20:16:29,258 INFO L226 Difference]: Without dead ends: 269 [2025-02-07 20:16:29,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-02-07 20:16:29,259 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:29,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 59 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:16:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-07 20:16:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-02-07 20:16:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.0151515151515151) internal successors, (268), 268 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 268 transitions. [2025-02-07 20:16:29,266 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 268 transitions. Word has length 251 [2025-02-07 20:16:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:29,266 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 268 transitions. [2025-02-07 20:16:29,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8615384615384616) internal successors, (251), 65 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 268 transitions. [2025-02-07 20:16:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-07 20:16:29,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:29,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 20:16:29,267 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:29,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1362270741, now seen corresponding path program 1 times [2025-02-07 20:16:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:29,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347271473] [2025-02-07 20:16:29,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:29,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-07 20:16:29,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-07 20:16:29,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:29,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:29,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:29,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347271473] [2025-02-07 20:16:29,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347271473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:29,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:29,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004986053] [2025-02-07 20:16:29,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:29,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:29,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:29,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:29,546 INFO L87 Difference]: Start difference. First operand 269 states and 268 transitions. Second operand has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:29,830 INFO L93 Difference]: Finished difference Result 269 states and 268 transitions. [2025-02-07 20:16:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-02-07 20:16:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:29,832 INFO L225 Difference]: With dead ends: 269 [2025-02-07 20:16:29,832 INFO L226 Difference]: Without dead ends: 267 [2025-02-07 20:16:29,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:16:29,832 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 317 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:29,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 45 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-07 20:16:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-02-07 20:16:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 263 states have (on average 1.0114068441064639) internal successors, (266), 266 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 266 transitions. [2025-02-07 20:16:29,835 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 266 transitions. Word has length 252 [2025-02-07 20:16:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:29,836 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 266 transitions. [2025-02-07 20:16:29,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 266 transitions. [2025-02-07 20:16:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-07 20:16:29,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:29,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 20:16:29,837 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:29,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:29,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1362794086, now seen corresponding path program 1 times [2025-02-07 20:16:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653321681] [2025-02-07 20:16:29,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:29,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-07 20:16:29,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-07 20:16:29,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:29,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:33,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653321681] [2025-02-07 20:16:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653321681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:33,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:33,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:16:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399664958] [2025-02-07 20:16:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 20:16:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:33,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 20:16:33,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:33,700 INFO L87 Difference]: Start difference. First operand 267 states and 266 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:33,978 INFO L93 Difference]: Finished difference Result 267 states and 266 transitions. [2025-02-07 20:16:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-02-07 20:16:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:33,979 INFO L225 Difference]: With dead ends: 267 [2025-02-07 20:16:33,979 INFO L226 Difference]: Without dead ends: 263 [2025-02-07 20:16:33,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:33,980 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:33,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 29 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:33,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-07 20:16:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-02-07 20:16:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 260 states have (on average 1.0076923076923077) internal successors, (262), 262 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 262 transitions. [2025-02-07 20:16:33,984 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 262 transitions. Word has length 252 [2025-02-07 20:16:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:33,985 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 262 transitions. [2025-02-07 20:16:33,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 262 transitions. [2025-02-07 20:16:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-07 20:16:33,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:33,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:33,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 20:16:33,986 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:33,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1381787836, now seen corresponding path program 1 times [2025-02-07 20:16:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803639696] [2025-02-07 20:16:33,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:34,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-07 20:16:34,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-07 20:16:34,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:34,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803639696] [2025-02-07 20:16:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803639696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 20:16:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11816354] [2025-02-07 20:16:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:34,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:16:34,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:34,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:16:34,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:16:34,259 INFO L87 Difference]: Start difference. First operand 263 states and 262 transitions. Second operand has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:34,589 INFO L93 Difference]: Finished difference Result 263 states and 262 transitions. [2025-02-07 20:16:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:16:34,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-02-07 20:16:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:34,591 INFO L225 Difference]: With dead ends: 263 [2025-02-07 20:16:34,591 INFO L226 Difference]: Without dead ends: 258 [2025-02-07 20:16:34,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:16:34,591 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 440 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:34,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 21 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:16:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-02-07 20:16:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-02-07 20:16:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 256 states have (on average 1.00390625) internal successors, (257), 257 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 257 transitions. [2025-02-07 20:16:34,594 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 257 transitions. Word has length 252 [2025-02-07 20:16:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:34,595 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 257 transitions. [2025-02-07 20:16:34,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 257 transitions. [2025-02-07 20:16:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-07 20:16:34,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:34,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:34,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 20:16:34,596 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:34,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -822806627, now seen corresponding path program 1 times [2025-02-07 20:16:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:34,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419768925] [2025-02-07 20:16:34,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:34,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-07 20:16:34,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-07 20:16:34,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:34,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:34,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:34,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419768925] [2025-02-07 20:16:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419768925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:34,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773894352] [2025-02-07 20:16:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:34,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:34,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:34,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:34,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:34,809 INFO L87 Difference]: Start difference. First operand 258 states and 257 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:34,940 INFO L93 Difference]: Finished difference Result 258 states and 257 transitions. [2025-02-07 20:16:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-02-07 20:16:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:34,942 INFO L225 Difference]: With dead ends: 258 [2025-02-07 20:16:34,942 INFO L226 Difference]: Without dead ends: 256 [2025-02-07 20:16:34,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:16:34,942 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:34,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 259 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:16:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-07 20:16:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-02-07 20:16:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.0) internal successors, (255), 255 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 255 transitions. [2025-02-07 20:16:34,946 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 255 transitions. Word has length 254 [2025-02-07 20:16:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:34,946 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 255 transitions. [2025-02-07 20:16:34,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 255 transitions. [2025-02-07 20:16:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-07 20:16:34,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:16:34,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 20:16:34,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 20:16:34,948 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 20:16:34,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:16:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash 262799152, now seen corresponding path program 1 times [2025-02-07 20:16:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:16:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151258517] [2025-02-07 20:16:34,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:16:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:16:34,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-07 20:16:35,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-07 20:16:35,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:16:35,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:16:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:16:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:16:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151258517] [2025-02-07 20:16:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151258517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:16:35,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:16:35,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 20:16:35,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463782357] [2025-02-07 20:16:35,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:16:35,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:16:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:16:35,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:16:35,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:35,183 INFO L87 Difference]: Start difference. First operand 256 states and 255 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:16:35,373 INFO L93 Difference]: Finished difference Result 256 states and 255 transitions. [2025-02-07 20:16:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:16:35,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-02-07 20:16:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:16:35,375 INFO L225 Difference]: With dead ends: 256 [2025-02-07 20:16:35,375 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:16:35,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:16:35,375 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:16:35,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 496 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 20:16:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:16:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:16:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:16:35,376 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2025-02-07 20:16:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:16:35,376 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:16:35,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:16:35,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:16:35,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:16:35,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-02-07 20:16:35,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-02-07 20:16:35,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-02-07 20:16:35,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-02-07 20:16:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-02-07 20:16:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-02-07 20:16:35,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-02-07 20:16:35,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 20:16:35,384 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:16:35,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:16:35,390 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:16:35,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:16:35 BoogieIcfgContainer [2025-02-07 20:16:35,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:16:35,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:16:35,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:16:35,398 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:16:35,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:16:09" (3/4) ... [2025-02-07 20:16:35,400 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:16:35,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 20:16:35,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:16:35,437 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 20:16:35,440 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:16:35,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:16:35,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:16:35,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:16:35,624 INFO L158 Benchmark]: Toolchain (without parser) took 28662.10ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 107.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. [2025-02-07 20:16:35,624 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:16:35,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 708.24ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 50.6MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-07 20:16:35,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.31ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 39.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:16:35,624 INFO L158 Benchmark]: Boogie Preprocessor took 144.84ms. Allocated memory is still 142.6MB. Free memory was 39.3MB in the beginning and 93.9MB in the end (delta: -54.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-02-07 20:16:35,625 INFO L158 Benchmark]: IcfgBuilder took 1755.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 93.9MB in the beginning and 155.7MB in the end (delta: -61.8MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. [2025-02-07 20:16:35,625 INFO L158 Benchmark]: TraceAbstraction took 25715.12ms. Allocated memory was 285.2MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 155.7MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. [2025-02-07 20:16:35,625 INFO L158 Benchmark]: Witness Printer took 225.01ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 20:16:35,626 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 708.24ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 50.6MB in the end (delta: 57.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.31ms. Allocated memory is still 142.6MB. Free memory was 50.6MB in the beginning and 39.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.84ms. Allocated memory is still 142.6MB. Free memory was 39.3MB in the beginning and 93.9MB in the end (delta: -54.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * IcfgBuilder took 1755.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 93.9MB in the beginning and 155.7MB in the end (delta: -61.8MB). Peak memory consumption was 86.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25715.12ms. Allocated memory was 285.2MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 155.7MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 140.1MB. Max. memory is 16.1GB. * Witness Printer took 225.01ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 53]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4678]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4690]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4714]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4726]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4743]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4755]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4783]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4795]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4811]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4823]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4854]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4866]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4893]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 4905]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 476 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2611 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2611 mSDsluCounter, 3596 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2006 mSDsCounter, 725 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14320 IncrementalHoareTripleChecker+Invalid, 15045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 725 mSolverCounterUnsat, 1590 mSDtfsCounter, 14320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 518 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=0, InterpolantAutomatonStates: 371, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 3506 NumberOfCodeBlocks, 3506 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3490 ConstructedInterpolants, 0 QuantifiedInterpolants, 7717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 20:16:35,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE