./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk --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.2.5-dev-a016563 [2024-11-09 00:19:32,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:33,051 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-09 00:19:33,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:33,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-09 00:19:33,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:33,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:33,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-09 00:19:33,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:33,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:33,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:33,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:33,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:33,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:19:33,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:33,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:33,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:33,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:33,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:33,113 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:33,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:33,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:33,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:33,119 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-09 00:19:33,120 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-09 00:19:33,120 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-09 00:19:33,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:33,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:19:33,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:33,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:33,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:33,123 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-09 00:19:33,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:19:33,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk 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-09 00:19:33,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:33,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:33,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:33,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:33,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:33,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c Unable to find full path for "g++" [2024-11-09 00:19:35,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:36,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:36,088 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2024-11-09 00:19:36,098 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/data/81ccf6e64/1990ad6b6f7e4ad5bbdb4f199bf174c2/FLAGd1f86a14c [2024-11-09 00:19:36,447 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/data/81ccf6e64/1990ad6b6f7e4ad5bbdb4f199bf174c2 [2024-11-09 00:19:36,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:36,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:36,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:36,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:36,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:36,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:36,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a10f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36, skipping insertion in model container [2024-11-09 00:19:36,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:36,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:36,759 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-11-09 00:19:36,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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-11-09 00:19:36,771 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-11-09 00:19:36,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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-11-09 00:19:36,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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-11-09 00:19:36,779 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-11-09 00:19:36,784 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-11-09 00:19:36,787 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-11-09 00:19:36,789 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-11-09 00:19:36,792 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-11-09 00:19:36,799 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-11-09 00:19:36,805 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-11-09 00:19:36,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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-11-09 00:19:36,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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-11-09 00:19:36,824 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-11-09 00:19:36,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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-11-09 00:19:36,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:36,863 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:36,887 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2024-11-09 00:19:36,890 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2024-11-09 00:19:36,893 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2024-11-09 00:19:36,895 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2024-11-09 00:19:36,897 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2024-11-09 00:19:36,899 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2024-11-09 00:19:36,903 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2024-11-09 00:19:36,905 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2024-11-09 00:19:36,909 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2024-11-09 00:19:36,911 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2024-11-09 00:19:36,923 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2024-11-09 00:19:36,925 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2024-11-09 00:19:36,929 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2024-11-09 00:19:36,932 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2024-11-09 00:19:36,935 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2024-11-09 00:19:36,938 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_b8957446-02fa-47f8-a43a-a0cfe9b7af81/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2024-11-09 00:19:36,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:36,966 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:36,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36 WrapperNode [2024-11-09 00:19:36,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:36,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:36,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:36,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:36,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:36,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,014 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2024-11-09 00:19:37,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:37,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:37,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:37,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:37,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:37,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:37,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:37,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:37,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:36" (1/1) ... [2024-11-09 00:19:37,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-09 00:19:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-09 00:19:37,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-09 00:19:37,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-09 00:19:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 00:19:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:37,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:37,222 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:37,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:37,642 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:37,642 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:37,672 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:37,673 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 00:19:37,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:37 BoogieIcfgContainer [2024-11-09 00:19:37,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:37,675 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-09 00:19:37,675 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-09 00:19:37,688 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-09 00:19:37,689 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:37" (1/1) ... [2024-11-09 00:19:37,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 58 states and 79 transitions. [2024-11-09 00:19:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-11-09 00:19:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 00:19:37,773 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:38,127 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-09 00:19:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 56 states and 76 transitions. [2024-11-09 00:19:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-11-09 00:19:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:19:38,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:38,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:38,474 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-09 00:19:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 62 states and 86 transitions. [2024-11-09 00:19:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-09 00:19:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 00:19:38,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:38,871 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-09 00:19:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 65 states and 90 transitions. [2024-11-09 00:19:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-11-09 00:19:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 00:19:39,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:39,262 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-09 00:19:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 68 states and 92 transitions. [2024-11-09 00:19:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2024-11-09 00:19:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:19:39,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:39,638 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-09 00:19:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 66 states and 88 transitions. [2024-11-09 00:19:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2024-11-09 00:19:40,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 00:19:40,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:40,244 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-09 00:19:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:41,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 74 states and 103 transitions. [2024-11-09 00:19:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-09 00:19:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:19:41,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:41,791 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-09 00:19:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 72 states and 99 transitions. [2024-11-09 00:19:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2024-11-09 00:19:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 00:19:42,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:42,849 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-09 00:19:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 80 states and 112 transitions. [2024-11-09 00:19:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2024-11-09 00:19:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 00:19:44,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:44,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:44,709 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-09 00:19:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 86 states and 117 transitions. [2024-11-09 00:19:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-11-09 00:19:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 00:19:46,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:46,348 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-09 00:19:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:48,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 93 states and 123 transitions. [2024-11-09 00:19:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2024-11-09 00:19:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 00:19:48,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:48,363 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-09 00:19:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 96 states and 125 transitions. [2024-11-09 00:19:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2024-11-09 00:19:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 00:19:51,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:51,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:51,509 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-09 00:19:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 109 states and 148 transitions. [2024-11-09 00:19:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 148 transitions. [2024-11-09 00:19:56,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:19:56,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:56,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:56,563 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-09 00:19:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:19:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 114 states and 154 transitions. [2024-11-09 00:19:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2024-11-09 00:19:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 00:19:58,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:19:58,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:58,450 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-09 00:20:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 119 states and 163 transitions. [2024-11-09 00:20:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2024-11-09 00:20:00,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 00:20:00,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:00,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:00,799 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-09 00:20:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 133 states and 186 transitions. [2024-11-09 00:20:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 186 transitions. [2024-11-09 00:20:07,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:20:07,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:07,771 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-09 00:20:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 136 states and 189 transitions. [2024-11-09 00:20:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2024-11-09 00:20:09,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 00:20:09,035 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:09,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:09,119 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-09 00:20:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 142 states and 200 transitions. [2024-11-09 00:20:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 200 transitions. [2024-11-09 00:20:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:20:12,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:13,128 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-09 00:20:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 145 states and 203 transitions. [2024-11-09 00:20:14,838 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2024-11-09 00:20:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 00:20:14,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:14,903 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-09 00:20:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 150 states and 210 transitions. [2024-11-09 00:20:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 210 transitions. [2024-11-09 00:20:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 00:20:18,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:18,046 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-09 00:20:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 151 states and 210 transitions. [2024-11-09 00:20:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 210 transitions. [2024-11-09 00:20:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 00:20:18,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:18,411 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-09 00:20:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 154 states and 213 transitions. [2024-11-09 00:20:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2024-11-09 00:20:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 00:20:20,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:20,584 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-09 00:20:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 159 states and 218 transitions. [2024-11-09 00:20:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 218 transitions. [2024-11-09 00:20:23,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 00:20:23,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:23,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:24,069 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-09 00:20:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 164 states and 228 transitions. [2024-11-09 00:20:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 228 transitions. [2024-11-09 00:20:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 00:20:27,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:27,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:27,450 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-09 00:20:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 165 states and 228 transitions. [2024-11-09 00:20:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 228 transitions. [2024-11-09 00:20:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:20:28,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:28,265 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-09 00:20:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 167 states and 230 transitions. [2024-11-09 00:20:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2024-11-09 00:20:30,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 00:20:30,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:30,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:30,576 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-09 00:20:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 175 states and 254 transitions. [2024-11-09 00:20:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 254 transitions. [2024-11-09 00:20:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:20:35,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:35,150 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-09 00:20:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 177 states and 255 transitions. [2024-11-09 00:20:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 255 transitions. [2024-11-09 00:20:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:20:36,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:37,111 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-09 00:20:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 179 states and 262 transitions. [2024-11-09 00:20:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 262 transitions. [2024-11-09 00:20:39,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:20:39,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:39,835 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-09 00:20:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 180 states and 265 transitions. [2024-11-09 00:20:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 265 transitions. [2024-11-09 00:20:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:20:40,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:40,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:40,898 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-09 00:20:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 182 states and 274 transitions. [2024-11-09 00:20:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 274 transitions. [2024-11-09 00:20:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 00:20:41,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:42,007 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-09 00:20:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 186 states and 283 transitions. [2024-11-09 00:20:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 283 transitions. [2024-11-09 00:20:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:20:44,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:44,552 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-09 00:20:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 196 states and 302 transitions. [2024-11-09 00:20:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 302 transitions. [2024-11-09 00:20:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 00:20:51,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:51,836 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-09 00:20:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:20:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 201 states and 311 transitions. [2024-11-09 00:20:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 311 transitions. [2024-11-09 00:20:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 00:20:55,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:20:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:20:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:55,112 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-09 00:21:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 207 states and 324 transitions. [2024-11-09 00:21:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 324 transitions. [2024-11-09 00:21:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 00:21:00,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:01,473 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-09 00:21:03,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 208 states and 327 transitions. [2024-11-09 00:21:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 327 transitions. [2024-11-09 00:21:03,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 00:21:03,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:03,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:03,426 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-09 00:21:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 213 states and 335 transitions. [2024-11-09 00:21:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 335 transitions. [2024-11-09 00:21:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:21:07,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:07,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:07,119 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-09 00:21:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 218 states and 342 transitions. [2024-11-09 00:21:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 342 transitions. [2024-11-09 00:21:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:21:11,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:11,868 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-09 00:21:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 224 states and 355 transitions. [2024-11-09 00:21:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 355 transitions. [2024-11-09 00:21:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 00:21:15,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:15,763 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-09 00:21:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 224 states and 354 transitions. [2024-11-09 00:21:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 354 transitions. [2024-11-09 00:21:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:21:20,576 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:20,635 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-09 00:21:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 224 states and 353 transitions. [2024-11-09 00:21:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 353 transitions. [2024-11-09 00:21:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 00:21:21,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:21,992 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-09 00:21:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 232 states and 365 transitions. [2024-11-09 00:21:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2024-11-09 00:21:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:21:29,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:29,284 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-09 00:21:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 233 states and 366 transitions. [2024-11-09 00:21:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 366 transitions. [2024-11-09 00:21:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:21:30,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:30,395 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-09 00:21:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 235 states and 371 transitions. [2024-11-09 00:21:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 371 transitions. [2024-11-09 00:21:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:21:32,391 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:33,360 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-09 00:21:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 243 states and 390 transitions. [2024-11-09 00:21:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 390 transitions. [2024-11-09 00:21:49,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:21:49,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:49,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:50,012 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-09 00:21:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:21:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 248 states and 394 transitions. [2024-11-09 00:21:54,430 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 394 transitions. [2024-11-09 00:21:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 00:21:54,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:21:54,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:21:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:21:54,518 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-09 00:22:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 258 states and 407 transitions. [2024-11-09 00:22:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 407 transitions. [2024-11-09 00:22:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:22:06,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:06,111 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-09 00:22:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 263 states and 414 transitions. [2024-11-09 00:22:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 414 transitions. [2024-11-09 00:22:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 00:22:12,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:12,245 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-09 00:22:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 268 states and 420 transitions. [2024-11-09 00:22:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 420 transitions. [2024-11-09 00:22:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 00:22:16,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:16,945 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-09 00:22:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 274 states and 437 transitions. [2024-11-09 00:22:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 437 transitions. [2024-11-09 00:22:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:22:21,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:21,961 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-09 00:22:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 274 states and 435 transitions. [2024-11-09 00:22:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 435 transitions. [2024-11-09 00:22:23,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:22:23,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:23,263 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-09 00:22:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 274 states and 433 transitions. [2024-11-09 00:22:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 433 transitions. [2024-11-09 00:22:24,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 00:22:24,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:24,516 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-09 00:22:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 274 states and 432 transitions. [2024-11-09 00:22:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 432 transitions. [2024-11-09 00:22:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 00:22:31,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:31,601 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-09 00:22:41,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 282 states and 446 transitions. [2024-11-09 00:22:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 446 transitions. [2024-11-09 00:22:41,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 00:22:41,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:41,707 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-09 00:22:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 285 states and 449 transitions. [2024-11-09 00:22:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 449 transitions. [2024-11-09 00:22:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 00:22:45,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:45,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:45,148 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-09 00:22:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 288 states and 452 transitions. [2024-11-09 00:22:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 452 transitions. [2024-11-09 00:22:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 00:22:48,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:48,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:48,457 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-09 00:22:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 292 states and 455 transitions. [2024-11-09 00:22:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 455 transitions. [2024-11-09 00:22:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 00:22:53,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:22:53,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:53,752 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-09 00:22:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:22:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 78 states and 96 transitions. [2024-11-09 00:22:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-11-09 00:22:58,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:22:58,643 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 58 iterations. [2024-11-09 00:22:58,654 INFO L729 CodeCheckObserver]: All specifications hold 16 specifications checked. All of them hold [2024-11-09 00:23:14,150 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2024-11-09 00:23:14,150 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2024-11-09 00:23:14,150 INFO L75 FloydHoareUtils]: For program point L217(line 217) no Hoare annotation was computed. [2024-11-09 00:23:14,151 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-09 00:23:14,151 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-09 00:23:14,151 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 13 313) the Hoare annotation is: true [2024-11-09 00:23:14,151 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2024-11-09 00:23:14,152 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-09 00:23:14,152 INFO L75 FloydHoareUtils]: For program point L193(line 193) no Hoare annotation was computed. [2024-11-09 00:23:14,152 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-09 00:23:14,152 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2024-11-09 00:23:14,153 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-09 00:23:14,153 INFO L77 FloydHoareUtils]: At program point L20(lines 20 312) the Hoare annotation is: true [2024-11-09 00:23:14,153 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-09 00:23:14,153 INFO L75 FloydHoareUtils]: For program point L177(line 177) no Hoare annotation was computed. [2024-11-09 00:23:14,153 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-09 00:23:14,154 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2024-11-09 00:23:14,154 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-09 00:23:14,154 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2024-11-09 00:23:14,154 INFO L75 FloydHoareUtils]: For program point L153(line 153) no Hoare annotation was computed. [2024-11-09 00:23:14,154 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2024-11-09 00:23:14,155 INFO L75 FloydHoareUtils]: For program point L112(line 112) no Hoare annotation was computed. [2024-11-09 00:23:14,155 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2024-11-09 00:23:14,155 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-09 00:23:14,155 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:23:14,155 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-09 00:23:14,156 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-09 00:23:14,156 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2024-11-09 00:23:14,156 INFO L75 FloydHoareUtils]: For program point L88(line 88) no Hoare annotation was computed. [2024-11-09 00:23:14,156 INFO L75 FloydHoareUtils]: For program point L245(line 245) no Hoare annotation was computed. [2024-11-09 00:23:14,156 INFO L75 FloydHoareUtils]: For program point L47(line 47) no Hoare annotation was computed. [2024-11-09 00:23:14,156 INFO L75 FloydHoareUtils]: For program point L229(line 229) no Hoare annotation was computed. [2024-11-09 00:23:14,156 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-09 00:23:14,157 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2024-11-09 00:23:14,157 INFO L75 FloydHoareUtils]: For program point L205(line 205) no Hoare annotation was computed. [2024-11-09 00:23:14,157 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-09 00:23:14,157 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-09 00:23:14,157 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-09 00:23:14,157 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2024-11-09 00:23:14,158 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-09 00:23:14,158 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2024-11-09 00:23:14,158 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-09 00:23:14,159 INFO L75 FloydHoareUtils]: For program point L165(line 165) no Hoare annotation was computed. [2024-11-09 00:23:14,159 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-09 00:23:14,159 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:23:14,159 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2024-11-09 00:23:14,159 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-09 00:23:14,160 INFO L75 FloydHoareUtils]: For program point L141(line 141) no Hoare annotation was computed. [2024-11-09 00:23:14,160 INFO L75 FloydHoareUtils]: For program point L100(line 100) no Hoare annotation was computed. [2024-11-09 00:23:14,160 INFO L75 FloydHoareUtils]: For program point L257(line 257) no Hoare annotation was computed. [2024-11-09 00:23:14,160 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-09 00:23:14,160 INFO L75 FloydHoareUtils]: For program point L59(line 59) no Hoare annotation was computed. [2024-11-09 00:23:14,160 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2024-11-09 00:23:14,161 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2024-11-09 00:23:14,161 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-09 00:23:14,161 INFO L75 FloydHoareUtils]: For program point L76(line 76) no Hoare annotation was computed. [2024-11-09 00:23:14,161 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2024-11-09 00:23:14,161 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-09 00:23:14,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:23:14 ImpRootNode [2024-11-09 00:23:14,193 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:23:14,194 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:23:14,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:23:14,194 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:23:14,194 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:37" (3/4) ... [2024-11-09 00:23:14,199 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:23:14,213 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-09 00:23:14,213 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 00:23:14,213 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:23:14,214 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:23:14,352 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:23:14,352 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:23:14,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:23:14,353 INFO L158 Benchmark]: Toolchain (without parser) took 217900.56ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 122.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 563.0MB. Max. memory is 16.1GB. [2024-11-09 00:23:14,353 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory was 84.9MB in the beginning and 84.9MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:23:14,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.40ms. Allocated memory is still 163.6MB. Free memory was 122.4MB in the beginning and 102.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:23:14,356 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.73ms. Allocated memory is still 163.6MB. Free memory was 102.9MB in the beginning and 101.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:23:14,356 INFO L158 Benchmark]: Boogie Preprocessor took 38.53ms. Allocated memory is still 163.6MB. Free memory was 101.0MB in the beginning and 99.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:23:14,357 INFO L158 Benchmark]: RCFGBuilder took 619.76ms. Allocated memory is still 163.6MB. Free memory was 99.3MB in the beginning and 122.9MB in the end (delta: -23.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-09 00:23:14,357 INFO L158 Benchmark]: CodeCheck took 216518.31ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 122.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 558.1MB. Max. memory is 16.1GB. [2024-11-09 00:23:14,357 INFO L158 Benchmark]: Witness Printer took 158.89ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:23:14,360 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: 200.9s, OverallIterations: 58, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13512 SdHoareTripleChecker+Valid, 81.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9194 mSDsluCounter, 5309 SdHoareTripleChecker+Invalid, 72.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3725 mSDsCounter, 13158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47012 IncrementalHoareTripleChecker+Invalid, 60170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13158 mSolverCounterUnsat, 1584 mSDtfsCounter, 47012 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13254 GetRequests, 11642 SyntacticMatches, 610 SemanticMatches, 1002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426483 ImplicationChecksByTransitivity, 191.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1477 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1420 ConstructedInterpolants, 0 QuantifiedInterpolants, 4820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 25 PerfectInterpolantSequences, 320/618 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 - 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.28ms. Allocated memory is still 117.4MB. Free memory was 84.9MB in the beginning and 84.9MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.40ms. Allocated memory is still 163.6MB. Free memory was 122.4MB in the beginning and 102.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.73ms. Allocated memory is still 163.6MB. Free memory was 102.9MB in the beginning and 101.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.53ms. Allocated memory is still 163.6MB. Free memory was 101.0MB in the beginning and 99.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 619.76ms. Allocated memory is still 163.6MB. Free memory was 99.3MB in the beginning and 122.9MB in the end (delta: -23.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * CodeCheck took 216518.31ms. Allocated memory was 163.6MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 122.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 558.1MB. Max. memory is 16.1GB. * Witness Printer took 158.89ms. Allocated memory is still 1.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-09 00:23:14,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8957446-02fa-47f8-a43a-a0cfe9b7af81/bin/ukojak-verify-ImItNfHLgk/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