./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3 --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:51:49,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:51:49,865 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:51:49,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:51:49,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:51:49,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:51:49,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:51:49,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:51:49,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:51:49,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:51:49,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:51:49,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:51:49,904 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:51:49,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:51:49,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:51:49,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:51:49,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:51:49,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:51:49,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:51:49,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:51:49,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:51:49,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:51:49,905 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:51:49,905 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:51:49,905 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:51:49,905 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:51:49,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:51:49,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:51:49,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:51:49,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:51:49,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:51:49,906 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:51:49,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:51:49,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3 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 -> Kojak 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 -> 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 [2024-11-25 03:51:50,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:51:50,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:51:50,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:51:50,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:51:50,237 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:51:50,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2024-11-25 03:51:53,216 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/data/8632390ad/d46aae5d574d4455b530934f5231510a/FLAG473a5deaf [2024-11-25 03:51:53,474 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:51:53,474 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2024-11-25 03:51:53,482 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/data/8632390ad/d46aae5d574d4455b530934f5231510a/FLAG473a5deaf [2024-11-25 03:51:53,496 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/data/8632390ad/d46aae5d574d4455b530934f5231510a [2024-11-25 03:51:53,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:51:53,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:51:53,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:51:53,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:51:53,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:51:53,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207794e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53, skipping insertion in model container [2024-11-25 03:51:53,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:51:53,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-11-25 03:51:53,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-11-25 03:51:53,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-11-25 03:51:53,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-11-25 03:51:53,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-11-25 03:51:53,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-11-25 03:51:53,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-11-25 03:51:53,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-11-25 03:51:53,760 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-11-25 03:51:53,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-11-25 03:51:53,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-11-25 03:51:53,769 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-11-25 03:51:53,770 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-11-25 03:51:53,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-11-25 03:51:53,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-11-25 03:51:53,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-11-25 03:51:53,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:51:53,794 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:51:53,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-11-25 03:51:53,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-11-25 03:51:53,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-11-25 03:51:53,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-11-25 03:51:53,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-11-25 03:51:53,815 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-11-25 03:51:53,818 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-11-25 03:51:53,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-11-25 03:51:53,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-11-25 03:51:53,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-11-25 03:51:53,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-11-25 03:51:53,827 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-11-25 03:51:53,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-11-25 03:51:53,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-11-25 03:51:53,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-11-25 03:51:53,833 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-11-25 03:51:53,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:51:53,848 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:51:53,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53 WrapperNode [2024-11-25 03:51:53,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:51:53,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:51:53,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:51:53,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:51:53,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,898 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2024-11-25 03:51:53,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:51:53,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:51:53,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:51:53,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:51:53,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:51:53,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:51:53,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:51:53,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:51:53,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:51:53" (1/1) ... [2024-11-25 03:51:53,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:51:53,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:51:54,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:51:54,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:51:54,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:51:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:51:54,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:51:54,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:51:54,122 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:51:54,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:51:54,397 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-25 03:51:54,397 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:51:54,420 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:51:54,421 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-25 03:51:54,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:54 BoogieIcfgContainer [2024-11-25 03:51:54,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:51:54,422 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:51:54,422 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:51:54,434 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:51:54,434 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:54" (1/1) ... [2024-11-25 03:51:54,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:51:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 58 states and 79 transitions. [2024-11-25 03:51:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-11-25 03:51:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-25 03:51:54,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:54,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:51:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 56 states and 76 transitions. [2024-11-25 03:51:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-25 03:51:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 03:51:54,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:51:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 62 states and 86 transitions. [2024-11-25 03:51:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-25 03:51:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-25 03:51:55,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:55,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:51:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 65 states and 90 transitions. [2024-11-25 03:51:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-11-25 03:51:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 03:51:55,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:51:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 68 states and 92 transitions. [2024-11-25 03:51:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-11-25 03:51:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:51:55,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:51:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 66 states and 88 transitions. [2024-11-25 03:51:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-25 03:51:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:51:56,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:51:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 74 states and 103 transitions. [2024-11-25 03:51:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-25 03:51:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 03:51:57,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:51:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:51:58,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 72 states and 99 transitions. [2024-11-25 03:51:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2024-11-25 03:51:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-25 03:51:58,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:51:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:51:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:51:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:00,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:00,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 80 states and 112 transitions. [2024-11-25 03:52:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2024-11-25 03:52:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-25 03:52:00,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-11-25 03:52:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-25 03:52:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-25 03:52:01,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 93 states and 123 transitions. [2024-11-25 03:52:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2024-11-25 03:52:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-25 03:52:03,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 96 states and 125 transitions. [2024-11-25 03:52:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2024-11-25 03:52:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 03:52:06,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:06,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 109 states and 148 transitions. [2024-11-25 03:52:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2024-11-25 03:52:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 03:52:11,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 114 states and 154 transitions. [2024-11-25 03:52:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2024-11-25 03:52:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 03:52:13,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 119 states and 163 transitions. [2024-11-25 03:52:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2024-11-25 03:52:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 03:52:15,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 133 states and 186 transitions. [2024-11-25 03:52:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 186 transitions. [2024-11-25 03:52:22,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 03:52:22,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 136 states and 189 transitions. [2024-11-25 03:52:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-11-25 03:52:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 03:52:24,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:52:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 142 states and 200 transitions. [2024-11-25 03:52:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2024-11-25 03:52:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 03:52:27,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 145 states and 203 transitions. [2024-11-25 03:52:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2024-11-25 03:52:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-25 03:52:29,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 150 states and 210 transitions. [2024-11-25 03:52:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 210 transitions. [2024-11-25 03:52:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-25 03:52:33,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:52:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 151 states and 210 transitions. [2024-11-25 03:52:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 210 transitions. [2024-11-25 03:52:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-25 03:52:33,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:33,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:52:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 154 states and 213 transitions. [2024-11-25 03:52:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2024-11-25 03:52:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 03:52:35,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:35,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 159 states and 218 transitions. [2024-11-25 03:52:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 218 transitions. [2024-11-25 03:52:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-25 03:52:38,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 164 states and 228 transitions. [2024-11-25 03:52:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2024-11-25 03:52:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-25 03:52:42,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:52:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 165 states and 228 transitions. [2024-11-25 03:52:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2024-11-25 03:52:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 03:52:42,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 167 states and 230 transitions. [2024-11-25 03:52:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2024-11-25 03:52:44,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-25 03:52:44,853 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:44,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 175 states and 254 transitions. [2024-11-25 03:52:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 254 transitions. [2024-11-25 03:52:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 03:52:49,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:52:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 177 states and 255 transitions. [2024-11-25 03:52:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2024-11-25 03:52:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 03:52:51,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 179 states and 262 transitions. [2024-11-25 03:52:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 262 transitions. [2024-11-25 03:52:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 03:52:54,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 182 states and 274 transitions. [2024-11-25 03:52:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 274 transitions. [2024-11-25 03:52:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-25 03:52:56,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:52:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:52:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 186 states and 283 transitions. [2024-11-25 03:52:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 283 transitions. [2024-11-25 03:52:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 03:52:58,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:52:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:52:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:52:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 196 states and 302 transitions. [2024-11-25 03:53:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 302 transitions. [2024-11-25 03:53:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 03:53:05,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 201 states and 311 transitions. [2024-11-25 03:53:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 311 transitions. [2024-11-25 03:53:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 03:53:09,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 03:53:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 207 states and 324 transitions. [2024-11-25 03:53:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 324 transitions. [2024-11-25 03:53:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 03:53:14,377 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:14,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 03:53:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 208 states and 327 transitions. [2024-11-25 03:53:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 327 transitions. [2024-11-25 03:53:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-25 03:53:17,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 213 states and 335 transitions. [2024-11-25 03:53:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 335 transitions. [2024-11-25 03:53:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 03:53:20,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:53:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 218 states and 342 transitions. [2024-11-25 03:53:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 342 transitions. [2024-11-25 03:53:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 03:53:25,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:53:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 224 states and 355 transitions. [2024-11-25 03:53:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 355 transitions. [2024-11-25 03:53:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-25 03:53:29,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:29,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:53:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 224 states and 354 transitions. [2024-11-25 03:53:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 354 transitions. [2024-11-25 03:53:33,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 03:53:33,892 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:33,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:53:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 224 states and 353 transitions. [2024-11-25 03:53:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 353 transitions. [2024-11-25 03:53:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-25 03:53:35,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:53:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 232 states and 365 transitions. [2024-11-25 03:53:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2024-11-25 03:53:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-25 03:53:42,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:42,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:53:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 233 states and 366 transitions. [2024-11-25 03:53:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 366 transitions. [2024-11-25 03:53:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-25 03:53:43,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:43,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:53:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:53:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 235 states and 371 transitions. [2024-11-25 03:53:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 371 transitions. [2024-11-25 03:53:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-25 03:53:45,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:53:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:53:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:53:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 243 states and 390 transitions. [2024-11-25 03:54:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 390 transitions. [2024-11-25 03:54:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-25 03:54:03,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:54:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 248 states and 394 transitions. [2024-11-25 03:54:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 394 transitions. [2024-11-25 03:54:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-25 03:54:07,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:54:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 258 states and 407 transitions. [2024-11-25 03:54:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 407 transitions. [2024-11-25 03:54:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 03:54:19,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 263 states and 414 transitions. [2024-11-25 03:54:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 414 transitions. [2024-11-25 03:54:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-25 03:54:25,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 268 states and 420 transitions. [2024-11-25 03:54:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 420 transitions. [2024-11-25 03:54:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-25 03:54:30,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:30,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:54:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 274 states and 437 transitions. [2024-11-25 03:54:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 437 transitions. [2024-11-25 03:54:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:54:34,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:54:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 274 states and 435 transitions. [2024-11-25 03:54:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 435 transitions. [2024-11-25 03:54:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:54:36,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:36,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 03:54:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:37,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 274 states and 433 transitions. [2024-11-25 03:54:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 433 transitions. [2024-11-25 03:54:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-25 03:54:37,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 03:54:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 274 states and 432 transitions. [2024-11-25 03:54:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 432 transitions. [2024-11-25 03:54:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-25 03:54:44,357 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:54:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 282 states and 446 transitions. [2024-11-25 03:54:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 446 transitions. [2024-11-25 03:54:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-25 03:54:53,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:53,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-25 03:54:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:54:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 285 states and 449 transitions. [2024-11-25 03:54:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 449 transitions. [2024-11-25 03:54:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-25 03:54:57,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:54:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:54:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:54:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 03:55:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:55:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 288 states and 452 transitions. [2024-11-25 03:55:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 452 transitions. [2024-11-25 03:55:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-25 03:55:00,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:55:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:55:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:55:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 03:55:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:55:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 292 states and 455 transitions. [2024-11-25 03:55:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 455 transitions. [2024-11-25 03:55:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-25 03:55:05,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:55:05,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:55:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:55:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 03:55:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:55:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 78 states and 96 transitions. [2024-11-25 03:55:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-11-25 03:55:10,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 03:55:10,566 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 57 iterations. [2024-11-25 03:55:10,580 INFO L726 CodeCheckObserver]: All specifications hold 16 specifications checked. All of them hold [2024-11-25 03:55:25,929 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2024-11-25 03:55:25,929 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2024-11-25 03:55:25,929 INFO L75 FloydHoareUtils]: For program point L217(line 217) no Hoare annotation was computed. [2024-11-25 03:55:25,930 INFO L77 FloydHoareUtils]: At program point L151(lines 151 281) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|) .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2 (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)))) [2024-11-25 03:55:25,930 INFO L77 FloydHoareUtils]: At program point L110(lines 110 123) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse1 (= |ULTIMATE.start_main_~main__j~0#1| 0)) (.cse5 (< |ULTIMATE.start_main_~main__len~0#1| (+ 2 |ULTIMATE.start_main_~main__i~0#1|))) (.cse0 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse3 (<= 1 |ULTIMATE.start_main_~main__i~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) .cse0 .cse2 .cse3) (and (<= 5 |ULTIMATE.start_main_~main__bufsize~0#1|) .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse0 .cse2 .cse3))) [2024-11-25 03:55:25,930 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 13 313) the Hoare annotation is: true [2024-11-25 03:55:25,930 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2024-11-25 03:55:25,930 INFO L77 FloydHoareUtils]: At program point L36(lines 36 300) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (not .cse2)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0)))) [2024-11-25 03:55:25,930 INFO L75 FloydHoareUtils]: For program point L193(line 193) no Hoare annotation was computed. [2024-11-25 03:55:25,930 INFO L77 FloydHoareUtils]: At program point $Ultimate##6(lines 34 305) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1))) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|) .cse0) (and (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 .cse0 (not .cse2)) (and .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0)))) [2024-11-25 03:55:25,930 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2024-11-25 03:55:25,931 INFO L77 FloydHoareUtils]: At program point L86(lines 86 127) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0))) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 .cse2 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) (and .cse0 .cse1 (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2))) [2024-11-25 03:55:25,931 INFO L77 FloydHoareUtils]: At program point L20(lines 20 312) the Hoare annotation is: true [2024-11-25 03:55:25,931 INFO L77 FloydHoareUtils]: At program point L243(lines 243 267) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~main__j~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1| 0)) (<= (+ 3 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 2 |ULTIMATE.start_main_~main__i~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) [2024-11-25 03:55:25,931 INFO L75 FloydHoareUtils]: For program point L177(line 177) no Hoare annotation was computed. [2024-11-25 03:55:25,931 INFO L77 FloydHoareUtils]: At program point L45(lines 45 288) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 .cse1 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse2 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse3)) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)))) [2024-11-25 03:55:25,931 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2024-11-25 03:55:25,931 INFO L77 FloydHoareUtils]: At program point L227(lines 227 269) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) (<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) [2024-11-25 03:55:25,931 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2024-11-25 03:55:25,931 INFO L75 FloydHoareUtils]: For program point L153(line 153) no Hoare annotation was computed. [2024-11-25 03:55:25,931 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2024-11-25 03:55:25,931 INFO L75 FloydHoareUtils]: For program point L112(line 112) no Hoare annotation was computed. [2024-11-25 03:55:25,931 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2024-11-25 03:55:25,935 INFO L77 FloydHoareUtils]: At program point L203(lines 203 273) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0)) (<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) [2024-11-25 03:55:25,935 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 03:55:25,936 INFO L77 FloydHoareUtils]: At program point L38(lines 38 294) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)) (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse2)))) [2024-11-25 03:55:25,936 INFO L77 FloydHoareUtils]: At program point $Ultimate##4(lines 30 311) the Hoare annotation is: (let ((.cse0 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)))) (or (and (<= |ULTIMATE.start_main_~main__len~0#1| |ULTIMATE.start_main_~main__i~0#1|) .cse0) (and (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) .cse0))) [2024-11-25 03:55:25,936 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2024-11-25 03:55:25,936 INFO L75 FloydHoareUtils]: For program point L88(line 88) no Hoare annotation was computed. [2024-11-25 03:55:25,936 INFO L75 FloydHoareUtils]: For program point L245(line 245) no Hoare annotation was computed. [2024-11-25 03:55:25,936 INFO L75 FloydHoareUtils]: For program point L47(line 47) no Hoare annotation was computed. [2024-11-25 03:55:25,936 INFO L75 FloydHoareUtils]: For program point L229(line 229) no Hoare annotation was computed. [2024-11-25 03:55:25,936 INFO L77 FloydHoareUtils]: At program point L163(lines 163 279) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse2 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0) (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)) (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 .cse2 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)))) [2024-11-25 03:55:25,936 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2024-11-25 03:55:25,936 INFO L75 FloydHoareUtils]: For program point L205(line 205) no Hoare annotation was computed. [2024-11-25 03:55:25,937 INFO L77 FloydHoareUtils]: At program point L139(lines 139 283) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse1 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse2 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 .cse1 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse2 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse3)) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)))) [2024-11-25 03:55:25,937 INFO L77 FloydHoareUtils]: At program point L98(lines 98 125) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0)) (.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 0))) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|))) (or (and (< |ULTIMATE.start_main_~main__len~0#1| (+ 2 |ULTIMATE.start_main_~main__i~0#1|)) .cse0 .cse1 .cse2 .cse3) (and (<= 5 |ULTIMATE.start_main_~main__bufsize~0#1|) .cse0 .cse1 .cse2 .cse3) (and (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~main__i~0#1|)))) [2024-11-25 03:55:25,937 INFO L77 FloydHoareUtils]: At program point L255(lines 255 265) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~main__j~0#1|) (<= (+ 3 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 2 |ULTIMATE.start_main_~main__i~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~15#1| 0))) [2024-11-25 03:55:25,937 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2024-11-25 03:55:25,937 INFO L77 FloydHoareUtils]: At program point L57(lines 57 286) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse2) (<= 0 |ULTIMATE.start_main_~main__i~0#1|) .cse3) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|) .cse3))) [2024-11-25 03:55:25,937 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2024-11-25 03:55:25,937 INFO L77 FloydHoareUtils]: At program point L74(lines 74 129) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (= |ULTIMATE.start_main_~main__i~0#1| 0)) (.cse2 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) .cse2 (not .cse3)) (and .cse0 .cse1 .cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse2))) [2024-11-25 03:55:25,937 INFO L75 FloydHoareUtils]: For program point L165(line 165) no Hoare annotation was computed. [2024-11-25 03:55:25,937 INFO L77 FloydHoareUtils]: At program point L66(lines 66 285) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|) (not .cse2)) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)))) [2024-11-25 03:55:25,937 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L77 FloydHoareUtils]: At program point L215(lines 215 271) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) (<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point L141(line 141) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point L100(line 100) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point L257(line 257) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L77 FloydHoareUtils]: At program point L191(lines 191 275) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0)) (<= (+ |ULTIMATE.start_main_~main__j~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|) (<= 1 |ULTIMATE.start_main_~main__i~0#1|)) [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point L59(line 59) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L77 FloydHoareUtils]: At program point L175(lines 175 277) the Hoare annotation is: (let ((.cse0 (<= (+ 2 |ULTIMATE.start_main_~main__i~0#1|) |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0))) (.cse2 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (= |ULTIMATE.start_main_~main__j~0#1| 0)) (.cse4 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse5 (<= 1 |ULTIMATE.start_main_~main__i~0#1|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0) .cse3 (<= 1 |ULTIMATE.start_main_~main__limit~0#1|)) (and (<= 1 |ULTIMATE.start_main_~main__j~0#1|) .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point L76(line 76) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2024-11-25 03:55:25,938 INFO L77 FloydHoareUtils]: At program point L68(lines 38 294) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~main__i~0#1| |ULTIMATE.start_main_~main__len~0#1|)) (.cse1 (<= (+ |ULTIMATE.start_main_~main__limit~0#1| 4) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse3 (<= (+ 5 |ULTIMATE.start_main_~main__j~0#1|) |ULTIMATE.start_main_~main__bufsize~0#1|)) (.cse2 (= |ULTIMATE.start_main_~main__i~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~main__j~0#1| 0) .cse3) (and .cse0 (< 0 (+ |ULTIMATE.start_main_~main__j~0#1| 1)) .cse1 (< 0 (+ |ULTIMATE.start_main_~main__i~0#1| 1)) .cse3 (not .cse2)))) [2024-11-25 03:55:25,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:55:25 ImpRootNode [2024-11-25 03:55:25,958 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:55:25,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:55:25,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:55:25,959 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:55:25,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:54" (3/4) ... [2024-11-25 03:55:25,962 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 03:55:25,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-25 03:55:25,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-25 03:55:25,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-25 03:55:25,971 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 03:55:26,083 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:55:26,083 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:55:26,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:55:26,084 INFO L158 Benchmark]: Toolchain (without parser) took 212584.04ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 92.7MB in the beginning and 746.1MB in the end (delta: -653.4MB). Peak memory consumption was 680.0MB. Max. memory is 16.1GB. [2024-11-25 03:55:26,084 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:55:26,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.57ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.2MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:55:26,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.97ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:55:26,085 INFO L158 Benchmark]: Boogie Preprocessor took 39.82ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 76.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:55:26,086 INFO L158 Benchmark]: RCFGBuilder took 481.58ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 60.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 03:55:26,087 INFO L158 Benchmark]: CodeCheck took 211536.22ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 60.6MB in the beginning and 754.5MB in the end (delta: -693.9MB). Peak memory consumption was 646.4MB. Max. memory is 16.1GB. [2024-11-25 03:55:26,088 INFO L158 Benchmark]: Witness Printer took 124.45ms. Allocated memory is still 1.5GB. Free memory was 754.5MB in the beginning and 746.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:55:26,089 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 58 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 196.1s, OverallIterations: 57, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13280 SdHoareTripleChecker+Valid, 74.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9047 mSDsluCounter, 5216 SdHoareTripleChecker+Invalid, 65.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3662 mSDsCounter, 12930 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46223 IncrementalHoareTripleChecker+Invalid, 59153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12930 mSolverCounterUnsat, 1554 mSDtfsCounter, 46223 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13028 GetRequests, 11429 SyntacticMatches, 597 SemanticMatches, 1002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426484 ImplicationChecksByTransitivity, 187.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1393 ConstructedInterpolants, 0 QuantifiedInterpolants, 4744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 25 PerfectInterpolantSequences, 320/615 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 47]: 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: 59]: 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: 76]: 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: 88]: 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: 100]: 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: 112]: 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: 141]: 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: 153]: 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: 165]: 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: 177]: 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: 193]: 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: 205]: 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: 217]: 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: 229]: 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: 245]: 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: 257]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((main__len <= main__i) && (0 < ((long long) main__i + 1))) || ((((long long) main__limit + 4) <= main__bufsize) && (0 < ((long long) main__i + 1)))) - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((main__len <= main__i) && (0 < ((long long) main__i + 1))) || ((((0 < ((long long) main__j + 1)) && (((long long) main__limit + 4) <= main__bufsize)) && (0 < ((long long) main__i + 1))) && (main__i != 0))) || (((((long long) main__limit + 4) <= main__bufsize) && (main__i == 0)) && (main__j == 0))) - InvariantResult [Line: 38]: Location Invariant Derived location invariant: ((((((main__i < main__len) && (((long long) main__limit + 4) <= main__bufsize)) && (main__i == 0)) && (main__j == 0)) && (((long long) 5 + main__j) <= main__bufsize)) || ((((((main__i < main__len) && (0 < ((long long) main__j + 1))) && (((long long) main__limit + 4) <= main__bufsize)) && (0 < ((long long) main__i + 1))) && (((long long) 5 + main__j) <= main__bufsize)) && (main__i != 0))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.57ms. Allocated memory is still 117.4MB. Free memory was 92.5MB in the beginning and 79.2MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.97ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 77.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.82ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 76.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 481.58ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 60.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 211536.22ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 60.6MB in the beginning and 754.5MB in the end (delta: -693.9MB). Peak memory consumption was 646.4MB. Max. memory is 16.1GB. * Witness Printer took 124.45ms. Allocated memory is still 1.5GB. Free memory was 754.5MB in the beginning and 746.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 03:55:26,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b5f88c6-7833-443c-ba1e-421a30d5be75/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE