./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:53:27,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:53:27,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:53:27,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:53:27,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:53:27,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:53:27,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:53:27,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:53:27,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:53:27,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:53:27,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:53:27,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:53:27,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:53:27,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:53:27,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:53:27,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:53:27,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:53:27,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:53:27,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:53:27,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:53:27,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:53:27,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:53:27,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:53:27,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:53:27,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:53:27,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:53:27,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:53:27,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:53:27,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:53:27,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:53:27,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:53:27,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:53:27,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:53:27,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:53:27,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:53:27,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:53:27,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:53:27,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:53:27,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:53:27,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:53:27,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:53:27,633 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:53:27,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:53:27,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:53:27,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:53:27,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:53:27,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:53:27,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:53:27,676 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:53:27,677 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:53:27,677 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:53:27,677 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:53:27,678 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:53:27,679 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:53:27,679 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:53:27,679 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:53:27,679 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:53:27,679 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:53:27,680 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:53:27,680 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:53:27,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:53:27,681 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:53:27,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:53:27,682 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:53:27,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:53:27,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:53:27,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:53:27,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:53:27,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:53:27,683 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:53:27,683 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:53:27,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:53:27,684 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:53:27,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:53:27,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:53:27,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:53:27,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:53:27,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:53:27,686 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:53:27,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:53:27,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:53:27,687 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:53:27,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:53:27,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:53:27,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:53:27,688 INFO L138 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2022-11-26 00:53:27,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:53:27,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:53:27,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:53:27,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:53:27,999 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:53:28,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-11-26 00:53:31,131 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:53:31,458 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:53:31,458 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-11-26 00:53:31,467 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/data/f7d797484/2e7cad1c92a948979cb237d3b372f12f/FLAGd1d8df382 [2022-11-26 00:53:31,482 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/data/f7d797484/2e7cad1c92a948979cb237d3b372f12f [2022-11-26 00:53:31,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:53:31,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:53:31,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:53:31,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:53:31,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:53:31,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6eab5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31, skipping insertion in model container [2022-11-26 00:53:31,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:53:31,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:53:31,708 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-11-26 00:53:31,710 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-11-26 00:53:31,713 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-11-26 00:53:31,714 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-11-26 00:53:31,717 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-11-26 00:53:31,719 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-11-26 00:53:31,722 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-11-26 00:53:31,724 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-11-26 00:53:31,728 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-11-26 00:53:31,730 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-11-26 00:53:31,733 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-11-26 00:53:31,735 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-11-26 00:53:31,738 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-11-26 00:53:31,741 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-11-26 00:53:31,743 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-11-26 00:53:31,745 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-11-26 00:53:31,748 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-11-26 00:53:31,749 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-11-26 00:53:31,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:53:31,764 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:53:31,781 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-11-26 00:53:31,783 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-11-26 00:53:31,784 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-11-26 00:53:31,786 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-11-26 00:53:31,788 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-11-26 00:53:31,790 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-11-26 00:53:31,792 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-11-26 00:53:31,794 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-11-26 00:53:31,798 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-11-26 00:53:31,799 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-11-26 00:53:31,802 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-11-26 00:53:31,804 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-11-26 00:53:31,807 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-11-26 00:53:31,809 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-11-26 00:53:31,811 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-11-26 00:53:31,813 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-11-26 00:53:31,816 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-11-26 00:53:31,817 WARN L237 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_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-11-26 00:53:31,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:53:31,836 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:53:31,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31 WrapperNode [2022-11-26 00:53:31,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:53:31,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:53:31,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:53:31,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:53:31,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,895 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 284 [2022-11-26 00:53:31,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:53:31,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:53:31,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:53:31,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:53:31,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,925 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:53:31,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:53:31,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:53:31,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:53:31,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (1/1) ... [2022-11-26 00:53:31,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:53:31,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:31,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:53:32,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:53:32,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:53:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:53:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:53:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:53:32,187 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:53:32,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:53:32,632 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:53:32,667 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:53:32,667 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:53:32,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:32 BoogieIcfgContainer [2022-11-26 00:53:32,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:53:32,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:53:32,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:53:32,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:53:32,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:53:31" (1/3) ... [2022-11-26 00:53:32,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7097cba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:53:32, skipping insertion in model container [2022-11-26 00:53:32,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:53:31" (2/3) ... [2022-11-26 00:53:32,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7097cba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:53:32, skipping insertion in model container [2022-11-26 00:53:32,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:32" (3/3) ... [2022-11-26 00:53:32,695 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-11-26 00:53:32,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:53:32,762 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-26 00:53:32,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:53:32,872 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@489ab044, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:53:32,872 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-26 00:53:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 102 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:32,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:53:32,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:32,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:32,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:32,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:32,888 INFO L85 PathProgramCache]: Analyzing trace with hash -35581712, now seen corresponding path program 1 times [2022-11-26 00:53:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:32,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104986113] [2022-11-26 00:53:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:33,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:33,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104986113] [2022-11-26 00:53:33,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104986113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:33,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:33,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:53:33,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682081212] [2022-11-26 00:53:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:33,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:53:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:33,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:53:33,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:33,139 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 102 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:33,244 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2022-11-26 00:53:33,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:53:33,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 00:53:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:33,268 INFO L225 Difference]: With dead ends: 107 [2022-11-26 00:53:33,269 INFO L226 Difference]: Without dead ends: 95 [2022-11-26 00:53:33,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:33,279 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:33,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 80 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:53:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-26 00:53:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-26 00:53:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4) internal successors, (98), 94 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-11-26 00:53:33,333 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 12 [2022-11-26 00:53:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:33,333 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-11-26 00:53:33,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-11-26 00:53:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 00:53:33,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:33,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:33,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:53:33,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:33,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1103032992, now seen corresponding path program 1 times [2022-11-26 00:53:33,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:33,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410916662] [2022-11-26 00:53:33,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:33,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:33,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:33,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410916662] [2022-11-26 00:53:33,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410916662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:33,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:33,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:53:33,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128642943] [2022-11-26 00:53:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:33,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:53:33,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:53:33,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:33,406 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:33,466 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-11-26 00:53:33,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:53:33,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-26 00:53:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:33,468 INFO L225 Difference]: With dead ends: 95 [2022-11-26 00:53:33,468 INFO L226 Difference]: Without dead ends: 90 [2022-11-26 00:53:33,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:33,470 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:33,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 65 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:53:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-26 00:53:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-26 00:53:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 89 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-11-26 00:53:33,481 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 13 [2022-11-26 00:53:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:33,482 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-11-26 00:53:33,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-11-26 00:53:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:53:33,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:33,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:33,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:53:33,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash 842219522, now seen corresponding path program 1 times [2022-11-26 00:53:33,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:33,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515115438] [2022-11-26 00:53:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:33,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:33,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515115438] [2022-11-26 00:53:33,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515115438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:33,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:33,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:53:33,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501565672] [2022-11-26 00:53:33,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:33,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:33,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:33,616 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:33,736 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-26 00:53:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:53:33,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-26 00:53:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:33,738 INFO L225 Difference]: With dead ends: 90 [2022-11-26 00:53:33,739 INFO L226 Difference]: Without dead ends: 82 [2022-11-26 00:53:33,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:33,740 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 139 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:33,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 58 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:53:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-26 00:53:33,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-26 00:53:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 81 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-11-26 00:53:33,762 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 15 [2022-11-26 00:53:33,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:33,763 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-11-26 00:53:33,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-11-26 00:53:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:53:33,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:33,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:33,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:53:33,767 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash 339001495, now seen corresponding path program 1 times [2022-11-26 00:53:33,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:33,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68100630] [2022-11-26 00:53:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:33,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:33,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68100630] [2022-11-26 00:53:33,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68100630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:33,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:33,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:53:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157367464] [2022-11-26 00:53:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:33,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:33,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:33,891 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:34,052 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2022-11-26 00:53:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:53:34,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-26 00:53:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:34,054 INFO L225 Difference]: With dead ends: 114 [2022-11-26 00:53:34,054 INFO L226 Difference]: Without dead ends: 107 [2022-11-26 00:53:34,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:34,056 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 106 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:34,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 120 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:53:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-26 00:53:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-26 00:53:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-11-26 00:53:34,069 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 16 [2022-11-26 00:53:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:34,070 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-11-26 00:53:34,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-11-26 00:53:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-26 00:53:34,071 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:34,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:34,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:53:34,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -714386527, now seen corresponding path program 1 times [2022-11-26 00:53:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:34,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643514929] [2022-11-26 00:53:34,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:34,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:34,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643514929] [2022-11-26 00:53:34,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643514929] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:34,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481021935] [2022-11-26 00:53:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:34,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:34,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:34,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:34,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:53:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:34,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:53:34,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:34,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:34,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481021935] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:34,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1947639184] [2022-11-26 00:53:34,792 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-26 00:53:34,793 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:53:34,799 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:53:34,806 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:53:34,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:53:37,056 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:53:42,024 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1182#(and (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483648)) (<= 0 |ULTIMATE.start_main_~main__tokenlen~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_3~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_17~0#1|) (<= |ULTIMATE.start_main_~main__urilen~0#1| 1000000) (<= |ULTIMATE.start_main_~main__tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~__tmp_3~0#1| 1) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_4~0#1|) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1) (= |ULTIMATE.start_main_~__tmp_18~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1|) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1|) (= |ULTIMATE.start_main_~__tmp_18~0#1| (ite (<= 0 |ULTIMATE.start_main_~main__cp~0#1|) 1 0)) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1) (<= 0 |ULTIMATE.start_main_~main__scheme~0#1|) (<= |ULTIMATE.start_main_~main__scheme~0#1| 999999) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) (<= 1 |ULTIMATE.start_main_~main__urilen~0#1|) (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483647) (<= |ULTIMATE.start_main_~__tmp_1~0#1| 1) (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 0) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1|) (<= |ULTIMATE.start_main_~__tmp_17~0#1| 1) (<= |ULTIMATE.start_main_~__tmp_4~0#1| 1) (= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~__tmp_2~0#1| 1) (< 2147483646 |ULTIMATE.start_main_~main__cp~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0)) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= ~__return_375~0 0) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_main_~__tmp_2~0#1|))' at error location [2022-11-26 00:53:42,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:53:42,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:53:42,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-26 00:53:42,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480911145] [2022-11-26 00:53:42,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:53:42,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:53:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:42,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:53:42,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=751, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:53:42,028 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 10 states, 9 states have (on average 11.555555555555555) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:42,766 INFO L93 Difference]: Finished difference Result 450 states and 499 transitions. [2022-11-26 00:53:42,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:53:42,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 11.555555555555555) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-26 00:53:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:42,771 INFO L225 Difference]: With dead ends: 450 [2022-11-26 00:53:42,771 INFO L226 Difference]: Without dead ends: 444 [2022-11-26 00:53:42,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 79 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=513, Invalid=1379, Unknown=0, NotChecked=0, Total=1892 [2022-11-26 00:53:42,774 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1155 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:42,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 245 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:53:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2022-11-26 00:53:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 281. [2022-11-26 00:53:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 274 states have (on average 1.145985401459854) internal successors, (314), 280 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 314 transitions. [2022-11-26 00:53:42,799 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 314 transitions. Word has length 39 [2022-11-26 00:53:42,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:42,799 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 314 transitions. [2022-11-26 00:53:42,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 11.555555555555555) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 314 transitions. [2022-11-26 00:53:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-26 00:53:42,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:42,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:42,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:43,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:43,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:43,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:43,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1145944335, now seen corresponding path program 1 times [2022-11-26 00:53:43,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:43,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761460344] [2022-11-26 00:53:43,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:43,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:43,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:43,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761460344] [2022-11-26 00:53:43,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761460344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:43,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:43,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:53:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099767716] [2022-11-26 00:53:43,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:43,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:53:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:43,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:53:43,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:43,141 INFO L87 Difference]: Start difference. First operand 281 states and 314 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:43,222 INFO L93 Difference]: Finished difference Result 393 states and 447 transitions. [2022-11-26 00:53:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:53:43,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-26 00:53:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:43,225 INFO L225 Difference]: With dead ends: 393 [2022-11-26 00:53:43,225 INFO L226 Difference]: Without dead ends: 281 [2022-11-26 00:53:43,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:43,227 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:43,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:53:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-26 00:53:43,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2022-11-26 00:53:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 274 states have (on average 1.1240875912408759) internal successors, (308), 280 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 308 transitions. [2022-11-26 00:53:43,243 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 308 transitions. Word has length 52 [2022-11-26 00:53:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:43,243 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 308 transitions. [2022-11-26 00:53:43,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 308 transitions. [2022-11-26 00:53:43,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-26 00:53:43,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:43,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:43,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:53:43,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:43,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1199382817, now seen corresponding path program 1 times [2022-11-26 00:53:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:43,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873690575] [2022-11-26 00:53:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:43,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:43,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873690575] [2022-11-26 00:53:43,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873690575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:43,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:43,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:53:43,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973122094] [2022-11-26 00:53:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:43,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:53:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:53:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:43,316 INFO L87 Difference]: Start difference. First operand 281 states and 308 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:43,334 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2022-11-26 00:53:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:53:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-11-26 00:53:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:43,337 INFO L225 Difference]: With dead ends: 281 [2022-11-26 00:53:43,337 INFO L226 Difference]: Without dead ends: 280 [2022-11-26 00:53:43,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:43,338 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:43,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 73 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:53:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-26 00:53:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2022-11-26 00:53:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 274 states have (on average 1.1058394160583942) internal successors, (303), 279 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2022-11-26 00:53:43,353 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 53 [2022-11-26 00:53:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:43,353 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2022-11-26 00:53:43,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2022-11-26 00:53:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-26 00:53:43,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:43,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:43,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:53:43,356 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1473838547, now seen corresponding path program 1 times [2022-11-26 00:53:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:43,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188020521] [2022-11-26 00:53:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:43,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:43,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188020521] [2022-11-26 00:53:43,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188020521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:43,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:43,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:53:43,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268974506] [2022-11-26 00:53:43,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:43,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:53:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:43,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:53:43,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:43,416 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:43,432 INFO L93 Difference]: Finished difference Result 280 states and 303 transitions. [2022-11-26 00:53:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:53:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-26 00:53:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:43,434 INFO L225 Difference]: With dead ends: 280 [2022-11-26 00:53:43,435 INFO L226 Difference]: Without dead ends: 279 [2022-11-26 00:53:43,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:43,436 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:43,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:53:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-26 00:53:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2022-11-26 00:53:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 274 states have (on average 1.0875912408759123) internal successors, (298), 278 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 298 transitions. [2022-11-26 00:53:43,449 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 298 transitions. Word has length 54 [2022-11-26 00:53:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:43,449 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 298 transitions. [2022-11-26 00:53:43,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 298 transitions. [2022-11-26 00:53:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-26 00:53:43,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:43,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:43,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:53:43,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:43,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash -43272535, now seen corresponding path program 1 times [2022-11-26 00:53:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:43,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695428752] [2022-11-26 00:53:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:43,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:43,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695428752] [2022-11-26 00:53:43,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695428752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:43,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:43,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:53:43,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386272353] [2022-11-26 00:53:43,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:43,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:53:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:43,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:53:43,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:43,519 INFO L87 Difference]: Start difference. First operand 279 states and 298 transitions. Second operand has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:43,543 INFO L93 Difference]: Finished difference Result 336 states and 365 transitions. [2022-11-26 00:53:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:53:43,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-26 00:53:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:43,546 INFO L225 Difference]: With dead ends: 336 [2022-11-26 00:53:43,546 INFO L226 Difference]: Without dead ends: 334 [2022-11-26 00:53:43,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:43,547 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:43,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 140 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:53:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-26 00:53:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2022-11-26 00:53:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.0823170731707317) internal successors, (355), 332 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 355 transitions. [2022-11-26 00:53:43,562 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 355 transitions. Word has length 59 [2022-11-26 00:53:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:43,563 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 355 transitions. [2022-11-26 00:53:43,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 355 transitions. [2022-11-26 00:53:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-26 00:53:43,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:43,565 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:43,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:53:43,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash -174156287, now seen corresponding path program 2 times [2022-11-26 00:53:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:43,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861620034] [2022-11-26 00:53:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:43,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:43,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:43,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861620034] [2022-11-26 00:53:43,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861620034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:43,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723587783] [2022-11-26 00:53:43,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:53:43,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:43,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:43,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:43,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:53:43,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 00:53:43,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:53:43,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:53:43,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:53:44,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-26 00:53:44,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723587783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [223722036] [2022-11-26 00:53:44,270 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2022-11-26 00:53:44,270 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:53:44,270 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:53:44,270 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:53:44,271 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:53:45,650 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:53:51,257 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5128#(and (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483648)) (<= 0 |ULTIMATE.start_main_~main__tokenlen~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_3~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_17~0#1|) (<= |ULTIMATE.start_main_~main__urilen~0#1| 1000000) (<= |ULTIMATE.start_main_~main__tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~__tmp_3~0#1| 1) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_4~0#1|) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1) (= |ULTIMATE.start_main_~__tmp_18~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1|) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1|) (= |ULTIMATE.start_main_~__tmp_18~0#1| (ite (<= 0 |ULTIMATE.start_main_~main__cp~0#1|) 1 0)) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1) (<= 0 |ULTIMATE.start_main_~main__scheme~0#1|) (<= |ULTIMATE.start_main_~main__scheme~0#1| 999999) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) (<= 1 |ULTIMATE.start_main_~main__urilen~0#1|) (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483647) (<= |ULTIMATE.start_main_~__tmp_1~0#1| 1) (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 0) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1|) (<= |ULTIMATE.start_main_~__tmp_17~0#1| 1) (<= |ULTIMATE.start_main_~__tmp_4~0#1| 1) (= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~__tmp_2~0#1| 1) (< 2147483646 |ULTIMATE.start_main_~main__cp~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0)) (<= 0 |#StackHeapBarrier|) (= ~__return_main~0 0) (= ~__return_375~0 0) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_main_~__tmp_2~0#1|))' at error location [2022-11-26 00:53:51,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:53:51,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:53:51,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2022-11-26 00:53:51,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517456434] [2022-11-26 00:53:51,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:53:51,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:53:51,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:51,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:53:51,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2022-11-26 00:53:51,261 INFO L87 Difference]: Start difference. First operand 333 states and 355 transitions. Second operand has 13 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:51,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:51,701 INFO L93 Difference]: Finished difference Result 551 states and 595 transitions. [2022-11-26 00:53:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:53:51,702 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-11-26 00:53:51,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:51,704 INFO L225 Difference]: With dead ends: 551 [2022-11-26 00:53:51,704 INFO L226 Difference]: Without dead ends: 548 [2022-11-26 00:53:51,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 164 SyntacticMatches, 21 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=500, Invalid=1480, Unknown=0, NotChecked=0, Total=1980 [2022-11-26 00:53:51,707 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 620 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:51,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 151 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:53:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-11-26 00:53:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 281. [2022-11-26 00:53:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 278 states have (on average 1.10431654676259) internal successors, (307), 280 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 307 transitions. [2022-11-26 00:53:51,725 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 307 transitions. Word has length 71 [2022-11-26 00:53:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:51,726 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 307 transitions. [2022-11-26 00:53:51,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.583333333333334) internal successors, (127), 13 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 307 transitions. [2022-11-26 00:53:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-26 00:53:51,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:51,728 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:51,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:51,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 00:53:51,939 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:51,940 INFO L85 PathProgramCache]: Analyzing trace with hash -864310089, now seen corresponding path program 1 times [2022-11-26 00:53:51,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:51,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781893690] [2022-11-26 00:53:51,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:51,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:52,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:52,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781893690] [2022-11-26 00:53:52,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781893690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:52,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79388730] [2022-11-26 00:53:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:52,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:52,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:52,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:52,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:53:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:52,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:53:52,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:52,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:53:52,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79388730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:52,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:53:52,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-11-26 00:53:52,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612108199] [2022-11-26 00:53:52,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:52,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:52,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:52,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:52,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:52,225 INFO L87 Difference]: Start difference. First operand 281 states and 307 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:52,251 INFO L93 Difference]: Finished difference Result 282 states and 307 transitions. [2022-11-26 00:53:52,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:53:52,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-11-26 00:53:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:52,254 INFO L225 Difference]: With dead ends: 282 [2022-11-26 00:53:52,254 INFO L226 Difference]: Without dead ends: 281 [2022-11-26 00:53:52,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:52,255 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:52,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:53:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-26 00:53:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2022-11-26 00:53:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 278 states have (on average 1.0827338129496402) internal successors, (301), 279 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 301 transitions. [2022-11-26 00:53:52,272 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 301 transitions. Word has length 76 [2022-11-26 00:53:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:52,272 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 301 transitions. [2022-11-26 00:53:52,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 301 transitions. [2022-11-26 00:53:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-26 00:53:52,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:52,275 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:52,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:52,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-26 00:53:52,487 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:53:52,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1023808753, now seen corresponding path program 1 times [2022-11-26 00:53:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:52,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410568166] [2022-11-26 00:53:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:53:52,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410568166] [2022-11-26 00:53:52,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410568166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:52,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234189274] [2022-11-26 00:53:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:52,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:52,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:52,578 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:52,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:53:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:52,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:53:52,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:52,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:52,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234189274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:52,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [628264402] [2022-11-26 00:53:52,793 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2022-11-26 00:53:52,793 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:53:52,795 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:53:52,795 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:53:52,796 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:53:56,384 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:54:13,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [628264402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:13,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:13,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [3, 3, 3] total 45 [2022-11-26 00:54:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911680666] [2022-11-26 00:54:13,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:13,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-26 00:54:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-26 00:54:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=1523, Unknown=0, NotChecked=0, Total=2070 [2022-11-26 00:54:13,015 INFO L87 Difference]: Start difference. First operand 280 states and 301 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:35,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:35,188 INFO L93 Difference]: Finished difference Result 507 states and 545 transitions. [2022-11-26 00:54:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-26 00:54:35,188 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-11-26 00:54:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:35,190 INFO L225 Difference]: With dead ends: 507 [2022-11-26 00:54:35,190 INFO L226 Difference]: Without dead ends: 232 [2022-11-26 00:54:35,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 21 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=1233, Invalid=3323, Unknown=0, NotChecked=0, Total=4556 [2022-11-26 00:54:35,192 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 252 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:35,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 72 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-26 00:54:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-26 00:54:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2022-11-26 00:54:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 226 states have (on average 1.084070796460177) internal successors, (245), 227 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 245 transitions. [2022-11-26 00:54:35,206 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 245 transitions. Word has length 77 [2022-11-26 00:54:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:35,207 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 245 transitions. [2022-11-26 00:54:35,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 245 transitions. [2022-11-26 00:54:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-26 00:54:35,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:35,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:35,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:35,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:35,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-11-26 00:54:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1790595673, now seen corresponding path program 1 times [2022-11-26 00:54:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:35,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635428458] [2022-11-26 00:54:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:54:35,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:35,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635428458] [2022-11-26 00:54:35,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635428458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:35,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916426957] [2022-11-26 00:54:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:35,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:35,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:35,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:35,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:54:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:35,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:54:35,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:54:35,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:54:35,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916426957] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1383348375] [2022-11-26 00:54:35,717 INFO L159 IcfgInterpreter]: Started Sifa with 71 locations of interest [2022-11-26 00:54:35,717 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:54:35,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:54:35,718 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:54:35,718 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:54:38,969 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:54:56,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1383348375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:54:56,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:56,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [3, 3, 3] total 50 [2022-11-26 00:54:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295492007] [2022-11-26 00:54:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:54:56,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-26 00:54:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:56,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-26 00:54:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=2154, Unknown=0, NotChecked=0, Total=2550 [2022-11-26 00:54:56,184 INFO L87 Difference]: Start difference. First operand 228 states and 245 transitions. Second operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:32,480 INFO L93 Difference]: Finished difference Result 274 states and 292 transitions. [2022-11-26 00:55:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-11-26 00:55:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-11-26 00:55:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:32,481 INFO L225 Difference]: With dead ends: 274 [2022-11-26 00:55:32,482 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:55:32,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=1559, Invalid=6273, Unknown=0, NotChecked=0, Total=7832 [2022-11-26 00:55:32,484 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:55:32,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-26 00:55:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:55:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:55:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:55:32,486 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2022-11-26 00:55:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:55:32,486 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:55:32,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:55:32,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:55:32,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2022-11-26 00:55:32,490 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2022-11-26 00:55:32,490 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2022-11-26 00:55:32,490 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2022-11-26 00:55:32,490 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2022-11-26 00:55:32,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2022-11-26 00:55:32,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2022-11-26 00:55:32,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2022-11-26 00:55:32,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2022-11-26 00:55:32,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2022-11-26 00:55:32,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2022-11-26 00:55:32,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2022-11-26 00:55:32,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2022-11-26 00:55:32,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2022-11-26 00:55:32,492 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2022-11-26 00:55:32,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2022-11-26 00:55:32,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2022-11-26 00:55:32,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2022-11-26 00:55:32,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2022-11-26 00:55:32,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2022-11-26 00:55:32,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2022-11-26 00:55:32,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2022-11-26 00:55:32,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2022-11-26 00:55:32,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2022-11-26 00:55:32,494 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2022-11-26 00:55:32,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2022-11-26 00:55:32,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2022-11-26 00:55:32,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2022-11-26 00:55:32,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2022-11-26 00:55:32,495 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2022-11-26 00:55:32,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 00:55:32,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:32,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:55:43,276 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 356 DAG size of output: 181 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 00:55:44,487 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 80) no Hoare annotation was computed. [2022-11-26 00:55:44,487 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-11-26 00:55:44,487 INFO L899 garLoopResultBuilder]: For program point L184-1(line 184) no Hoare annotation was computed. [2022-11-26 00:55:44,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-11-26 00:55:44,488 INFO L899 garLoopResultBuilder]: For program point L234(line 234) no Hoare annotation was computed. [2022-11-26 00:55:44,488 INFO L899 garLoopResultBuilder]: For program point L234-1(line 234) no Hoare annotation was computed. [2022-11-26 00:55:44,488 INFO L899 garLoopResultBuilder]: For program point L234-2(lines 234 338) no Hoare annotation was computed. [2022-11-26 00:55:44,488 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-11-26 00:55:44,488 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:55:44,489 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-11-26 00:55:44,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2022-11-26 00:55:44,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 162) no Hoare annotation was computed. [2022-11-26 00:55:44,489 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-11-26 00:55:44,489 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 264) no Hoare annotation was computed. [2022-11-26 00:55:44,491 INFO L895 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (let ((.cse12 (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse8 (<= 0 |ULTIMATE.start_main_~main__scheme~0#1|))) (or (let ((.cse13 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (< 0 |ULTIMATE.start_main_~main__tokenlen~0#1|) (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 2147483648)) (= 41 (select |#length| 2)) (= (select |#valid| 1) 1) (not (= |ULTIMATE.start_main_~main__scheme~0#1| 0)) (<= |ULTIMATE.start_main_~main__cp~0#1| 1000000) (= (select |#valid| 0) 0) (let ((.cse0 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483648))) (.cse2 (<= |ULTIMATE.start_main_~main__urilen~0#1| 1000000)) (.cse3 (<= |ULTIMATE.start_main_~main__tokenlen~0#1| 1000000)) (.cse4 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1)) (.cse6 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1|)) (.cse7 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1)) (.cse9 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse10 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1)) (.cse11 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483647))) (or (and .cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) (= |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__scheme~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (= (ite .cse1 1 0) |ULTIMATE.start_main_~__tmp_2~0#1|) .cse2 .cse3 .cse4 .cse5 (= (ite (< |ULTIMATE.start_main_~main__cp~0#1| (+ |ULTIMATE.start_main_~main__urilen~0#1| 1)) 1 0) |ULTIMATE.start_main_~__tmp_1~0#1|) .cse6 .cse7 .cse8 .cse9 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0)) (not (< |ULTIMATE.start_main_~main__urilen~0#1| (+ |ULTIMATE.start_main_~main__scheme~0#1| 1))) .cse10 .cse11 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| |ULTIMATE.start_main_~__tmp_4~0#1|) (= (ite (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) 1 0) |ULTIMATE.start_main_~__tmp_3~0#1|) (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 0)) (= (ite .cse12 1 0) |ULTIMATE.start_main_~__tmp_4~0#1|)) (and .cse0 (<= 0 |ULTIMATE.start_main_~__tmp_3~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_17~0#1|) .cse2 .cse3 (<= |ULTIMATE.start_main_~__tmp_3~0#1| 1) .cse4 (<= 0 |ULTIMATE.start_main_~__tmp_4~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_18~0#1|) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) .cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~main__scheme~0#1| 999999) .cse9 (<= |ULTIMATE.start_main_~__tmp_18~0#1| 1) .cse1 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 1) .cse10 (<= 1 |ULTIMATE.start_main_~main__urilen~0#1|) .cse11 (<= |ULTIMATE.start_main_~__tmp_1~0#1| 1) (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1|) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1|) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1|) (<= |ULTIMATE.start_main_~__tmp_17~0#1| 1) (<= |ULTIMATE.start_main_~__tmp_4~0#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 1) (<= |ULTIMATE.start_main_~__tmp_2~0#1| 1)))) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse13 0) 48) (= (select .cse13 1) 0) (= ~__return_main~0 0) (= ~__return_375~0 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 0)) (<= 0 |ULTIMATE.start_main_~__tmp_2~0#1|))) (and (<= |ULTIMATE.start_main_~main__scheme~0#1| 1000000) .cse12 .cse8 (<= |ULTIMATE.start_main_~main__cp~0#1| 999999) (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))) [2022-11-26 00:55:44,491 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 162) no Hoare annotation was computed. [2022-11-26 00:55:44,492 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-11-26 00:55:44,492 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-11-26 00:55:44,492 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2022-11-26 00:55:44,492 INFO L899 garLoopResultBuilder]: For program point L71-2(lines 71 416) no Hoare annotation was computed. [2022-11-26 00:55:44,492 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-11-26 00:55:44,492 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-11-26 00:55:44,493 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 200) no Hoare annotation was computed. [2022-11-26 00:55:44,493 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-11-26 00:55:44,493 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-11-26 00:55:44,493 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-11-26 00:55:44,493 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 200) no Hoare annotation was computed. [2022-11-26 00:55:44,493 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-11-26 00:55:44,494 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-11-26 00:55:44,494 INFO L899 garLoopResultBuilder]: For program point L172-1(line 172) no Hoare annotation was computed. [2022-11-26 00:55:44,494 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-11-26 00:55:44,494 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 391) no Hoare annotation was computed. [2022-11-26 00:55:44,494 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 184) no Hoare annotation was computed. [2022-11-26 00:55:44,494 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-11-26 00:55:44,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:55:44,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 391) no Hoare annotation was computed. [2022-11-26 00:55:44,495 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-11-26 00:55:44,495 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-11-26 00:55:44,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 184) no Hoare annotation was computed. [2022-11-26 00:55:44,495 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 234) no Hoare annotation was computed. [2022-11-26 00:55:44,496 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-11-26 00:55:44,496 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 80) no Hoare annotation was computed. [2022-11-26 00:55:44,496 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-11-26 00:55:44,496 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-11-26 00:55:44,496 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2022-11-26 00:55:44,496 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-11-26 00:55:44,497 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-11-26 00:55:44,497 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 131) no Hoare annotation was computed. [2022-11-26 00:55:44,497 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 234) no Hoare annotation was computed. [2022-11-26 00:55:44,497 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-11-26 00:55:44,497 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 131) no Hoare annotation was computed. [2022-11-26 00:55:44,497 INFO L899 garLoopResultBuilder]: For program point L391(line 391) no Hoare annotation was computed. [2022-11-26 00:55:44,498 INFO L899 garLoopResultBuilder]: For program point L391-1(line 391) no Hoare annotation was computed. [2022-11-26 00:55:44,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-26 00:55:44,498 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-11-26 00:55:44,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-11-26 00:55:44,498 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-11-26 00:55:44,499 INFO L895 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (let ((.cse22 (select |#memory_int| 1))) (let ((.cse0 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483648))) (.cse1 (= (select |#length| 3) 12)) (.cse3 (<= |ULTIMATE.start_main_~main__urilen~0#1| 1000000)) (.cse4 (<= |ULTIMATE.start_main_~main__tokenlen~0#1| 1000000)) (.cse5 (= 2 (select |#length| 1))) (.cse6 (<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (< 0 |ULTIMATE.start_main_~main__tokenlen~0#1|)) (.cse2 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse9 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483647)) (.cse10 (= 41 (select |#length| 2))) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (not (= |ULTIMATE.start_main_~main__scheme~0#1| 0))) (.cse13 (= (select |#valid| 0) 0)) (.cse14 (= (select |#valid| 2) 1)) (.cse15 (= |#NULL.offset| 0)) (.cse16 (= (select .cse22 0) 48)) (.cse17 (= (select .cse22 1) 0)) (.cse18 (= ~__return_main~0 0)) (.cse19 (= ~__return_375~0 0)) (.cse20 (< 0 |#StackHeapBarrier|)) (.cse21 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse0 .cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| |ULTIMATE.start_main_~__tmp_2~0#1|) (= |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__scheme~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| |ULTIMATE.start_main_~__tmp_3~0#1|) (= (ite .cse2 1 0) |ULTIMATE.start_main_~__tmp_2~0#1|) .cse3 .cse4 (= (ite (< |ULTIMATE.start_main_~main__cp~0#1| (+ |ULTIMATE.start_main_~main__urilen~0#1| 1)) 1 0) |ULTIMATE.start_main_~__tmp_1~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ |ULTIMATE.start_main_~main__scheme~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| |ULTIMATE.start_main_~__tmp_4~0#1|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= (ite (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) 1 0) |ULTIMATE.start_main_~__tmp_3~0#1|) .cse17 .cse18 .cse19 .cse20 .cse21 (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 0)) (= (ite (<= 0 |ULTIMATE.start_main_~main__cp~0#1|) 1 0) |ULTIMATE.start_main_~__tmp_4~0#1|)) (and .cse0 .cse1 (<= 0 |ULTIMATE.start_main_~__tmp_3~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_17~0#1|) .cse3 .cse4 (<= |ULTIMATE.start_main_~__tmp_3~0#1| 1) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_4~0#1|) (<= 0 |ULTIMATE.start_main_~__tmp_18~0#1|) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1|) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1) .cse5 .cse6 .cse7 .cse8 (<= |ULTIMATE.start_main_~main__scheme~0#1| 999999) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1|) (<= |ULTIMATE.start_main_~__tmp_18~0#1| 1) .cse2 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 1) (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) (<= 1 |ULTIMATE.start_main_~main__urilen~0#1|) .cse9 (<= |ULTIMATE.start_main_~__tmp_1~0#1| 1) (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1|) .cse10 .cse11 (= |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 0) (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1|) .cse12 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1|) (<= |ULTIMATE.start_main_~__tmp_17~0#1| 1) (<= |ULTIMATE.start_main_~main__cp~0#1| 1000000) (<= |ULTIMATE.start_main_~__tmp_4~0#1| 1) .cse13 .cse14 .cse15 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 1) .cse16 (<= |ULTIMATE.start_main_~__tmp_2~0#1| 1) .cse17 .cse18 .cse19 .cse20 .cse21 (<= 0 |ULTIMATE.start_main_~__tmp_2~0#1|))))) [2022-11-26 00:55:44,499 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-11-26 00:55:44,500 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2022-11-26 00:55:44,500 INFO L899 garLoopResultBuilder]: For program point L194-1(line 194) no Hoare annotation was computed. [2022-11-26 00:55:44,500 INFO L899 garLoopResultBuilder]: For program point L194-2(line 194) no Hoare annotation was computed. [2022-11-26 00:55:44,500 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-11-26 00:55:44,500 INFO L899 garLoopResultBuilder]: For program point L194-3(line 194) no Hoare annotation was computed. [2022-11-26 00:55:44,500 INFO L899 garLoopResultBuilder]: For program point L194-4(lines 194 354) no Hoare annotation was computed. [2022-11-26 00:55:44,500 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-11-26 00:55:44,501 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-11-26 00:55:44,501 INFO L895 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (let ((.cse12 (<= 0 |ULTIMATE.start_main_~main__cp~0#1|))) (let ((.cse79 (select |#memory_int| 1)) (.cse77 (ite .cse12 1 0)) (.cse78 (ite (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) 1 0))) (let ((.cse48 (< (+ |ULTIMATE.start_main_~main__c~0#1| 1) |ULTIMATE.start_main_~main__tokenlen~0#1|)) (.cse0 (<= 0 |ULTIMATE.start_main_~__tmp_5~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~__tmp_9~0#1| 1)) (.cse2 (<= |ULTIMATE.start_main_~__tmp_6~0#1| 1)) (.cse3 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483648))) (.cse4 (= (select |#length| 3) 12)) (.cse5 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse6 (<= 0 |ULTIMATE.start_main_~__tmp_7~0#1|)) (.cse7 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 2147483648))) (.cse8 (<= |ULTIMATE.start_main_~main__scheme~0#1| 1000000)) (.cse9 (<= 0 |ULTIMATE.start_main_~__tmp_3~0#1|)) (.cse10 (<= 0 (+ 1000000 |ULTIMATE.start_main_~main__urilen~0#1|))) (.cse11 (<= |ULTIMATE.start_main_~main__urilen~0#1| 1000000)) (.cse13 (<= |ULTIMATE.start_main_~main__tokenlen~0#1| 1000000)) (.cse14 (<= |ULTIMATE.start_main_~__tmp_3~0#1| 1)) (.cse15 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)) (.cse16 (<= 0 |ULTIMATE.start_main_~__tmp_4~0#1|)) (.cse17 (= |ULTIMATE.start_main_~__tmp_11~0#1| .cse78)) (.cse18 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse19 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse20 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1)) (.cse21 (<= |ULTIMATE.start_main_~__tmp_8~0#1| 1)) (.cse22 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 2147483647)) (.cse23 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 1)) (.cse24 (<= |ULTIMATE.start_main_~__tmp_7~0#1| 1)) (.cse25 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 1)) (.cse76 (<= 1 |ULTIMATE.start_main_~main__c~0#1|)) (.cse26 (<= 0 |ULTIMATE.start_main_~__tmp_9~0#1|)) (.cse27 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1|)) (.cse28 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1|)) (.cse29 (= |ULTIMATE.start_main_~__tmp_12~0#1| .cse77)) (.cse30 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1|)) (.cse31 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1)) (.cse32 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1)) (.cse33 (<= |ULTIMATE.start_main_~__tmp_10~0#1| 1)) (.cse34 (<= |ULTIMATE.start_main_~__tmp_5~0#1| 1)) (.cse35 (= 2 (select |#length| 1))) (.cse36 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 1)) (.cse37 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse38 (= (select |#valid| 3) 1)) (.cse39 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 2147483647)) (.cse40 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1|)) (.cse41 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_3~0#1| 2147483647)) (.cse42 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse43 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_3~0#1| 2147483648))) (.cse44 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1|)) (.cse45 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1)) (.cse46 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483647)) (.cse47 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 2147483648))) (.cse49 (<= 0 |ULTIMATE.start_main_~__tmp_8~0#1|)) (.cse50 (<= 0 |ULTIMATE.start_main_~__tmp_6~0#1|)) (.cse51 (<= |ULTIMATE.start_main_~__tmp_1~0#1| 1)) (.cse52 (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse53 (= 41 (select |#length| 2))) (.cse54 (= (select |#valid| 1) 1)) (.cse55 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1|)) (.cse56 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1|)) (.cse57 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1|)) (.cse58 (<= |ULTIMATE.start_main_~__tmp_4~0#1| 1)) (.cse59 (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|))) (.cse60 (= (select |#valid| 0) 0)) (.cse61 (= (select |#valid| 2) 1)) (.cse62 (= |#NULL.offset| 0)) (.cse63 (= |ULTIMATE.start_main_~__tmp_12~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1|)) (.cse64 (= (select .cse79 0) 48)) (.cse65 (<= |ULTIMATE.start_main_~__tmp_2~0#1| 1)) (.cse66 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 1)) (.cse67 (<= 1 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse68 (= |ULTIMATE.start_main_~__tmp_11~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)) (.cse69 (= (select .cse79 1) 0)) (.cse70 (= ~__return_main~0 0)) (.cse71 (= ~__return_375~0 0)) (.cse72 (<= 0 |ULTIMATE.start_main_~__tmp_10~0#1|)) (.cse73 (< 0 |#StackHeapBarrier|)) (.cse74 (= |#NULL.base| 0)) (.cse75 (<= 0 |ULTIMATE.start_main_~__tmp_2~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 (= |ULTIMATE.start_main_~main__c~0#1| 0) .cse75) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse76 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_main_~__tmp_16~0#1| .cse77) .cse21 .cse22 .cse23 .cse24 .cse25 .cse76 (= |ULTIMATE.start_main_~__tmp_14~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1|) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_main_~__tmp_13~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1|) .cse37 .cse38 (= |ULTIMATE.start_main_~__tmp_13~0#1| (ite (< |ULTIMATE.start_main_~main__c~0#1| |ULTIMATE.start_main_~main__tokenlen~0#1|) 1 0)) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 (= |ULTIMATE.start_main_~__tmp_14~0#1| (ite (<= 0 |ULTIMATE.start_main_~main__c~0#1|) 1 0)) .cse49 .cse50 .cse51 (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_3~0#1| 0)) .cse52 .cse53 .cse54 .cse55 (= |ULTIMATE.start_main_~__tmp_15~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1|) .cse56 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) (= |ULTIMATE.start_main_~__tmp_16~0#1| |ULTIMATE.start_main_~__VERIFIER_assert__cond~15#1|) .cse57 (= |ULTIMATE.start_main_~__tmp_15~0#1| .cse78) .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75))))) [2022-11-26 00:55:44,502 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-11-26 00:55:44,502 INFO L899 garLoopResultBuilder]: For program point L162(line 162) no Hoare annotation was computed. [2022-11-26 00:55:44,502 INFO L899 garLoopResultBuilder]: For program point L162-1(line 162) no Hoare annotation was computed. [2022-11-26 00:55:44,502 INFO L899 garLoopResultBuilder]: For program point L162-2(lines 162 359) no Hoare annotation was computed. [2022-11-26 00:55:44,502 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-11-26 00:55:44,503 INFO L895 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (<= 0 (+ 1000000 |ULTIMATE.start_main_~main__urilen~0#1|)) [2022-11-26 00:55:44,503 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-11-26 00:55:44,503 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 314) no Hoare annotation was computed. [2022-11-26 00:55:44,503 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-11-26 00:55:44,503 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-11-26 00:55:44,503 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2022-11-26 00:55:44,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2022-11-26 00:55:44,504 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-11-26 00:55:44,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 314) no Hoare annotation was computed. [2022-11-26 00:55:44,504 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2022-11-26 00:55:44,504 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-11-26 00:55:44,504 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 131 402) no Hoare annotation was computed. [2022-11-26 00:55:44,505 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-11-26 00:55:44,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 92) no Hoare annotation was computed. [2022-11-26 00:55:44,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 232) no Hoare annotation was computed. [2022-11-26 00:55:44,505 INFO L899 garLoopResultBuilder]: For program point L264(line 264) no Hoare annotation was computed. [2022-11-26 00:55:44,505 INFO L899 garLoopResultBuilder]: For program point L264-1(line 264) no Hoare annotation was computed. [2022-11-26 00:55:44,505 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 92) no Hoare annotation was computed. [2022-11-26 00:55:44,506 INFO L899 garLoopResultBuilder]: For program point L314(line 314) no Hoare annotation was computed. [2022-11-26 00:55:44,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 232) no Hoare annotation was computed. [2022-11-26 00:55:44,506 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-11-26 00:55:44,506 INFO L899 garLoopResultBuilder]: For program point L232(line 232) no Hoare annotation was computed. [2022-11-26 00:55:44,506 INFO L899 garLoopResultBuilder]: For program point L232-1(lines 232 343) no Hoare annotation was computed. [2022-11-26 00:55:44,507 INFO L895 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse69 (select |#memory_int| 1))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~__tmp_5~0#1|)) (.cse1 (<= |ULTIMATE.start_main_~__tmp_9~0#1| 1)) (.cse2 (<= |ULTIMATE.start_main_~__tmp_6~0#1| 1)) (.cse3 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483648))) (.cse4 (= (select |#length| 3) 12)) (.cse5 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse6 (<= 0 |ULTIMATE.start_main_~__tmp_7~0#1|)) (.cse7 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 2147483648))) (.cse8 (<= |ULTIMATE.start_main_~main__scheme~0#1| 1000000)) (.cse9 (<= 0 |ULTIMATE.start_main_~__tmp_3~0#1|)) (.cse10 (<= 0 (+ 1000000 |ULTIMATE.start_main_~main__urilen~0#1|))) (.cse11 (<= |ULTIMATE.start_main_~main__urilen~0#1| 1000000)) (.cse12 (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse13 (<= |ULTIMATE.start_main_~main__tokenlen~0#1| 1000000)) (.cse14 (<= |ULTIMATE.start_main_~__tmp_3~0#1| 1)) (.cse15 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)) (.cse16 (<= 0 |ULTIMATE.start_main_~__tmp_4~0#1|)) (.cse17 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse18 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse19 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 1)) (.cse20 (<= |ULTIMATE.start_main_~__tmp_8~0#1| 1)) (.cse21 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 2147483647)) (.cse22 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 1)) (.cse23 (<= |ULTIMATE.start_main_~__tmp_7~0#1| 1)) (.cse24 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 1)) (.cse25 (<= 0 |ULTIMATE.start_main_~__tmp_9~0#1|)) (.cse26 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1|)) (.cse27 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1|)) (.cse28 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1|)) (.cse29 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1)) (.cse30 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1)) (.cse31 (<= |ULTIMATE.start_main_~__tmp_10~0#1| 1)) (.cse32 (<= |ULTIMATE.start_main_~__tmp_5~0#1| 1)) (.cse33 (= 2 (select |#length| 1))) (.cse34 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 1)) (.cse35 (= (select |#valid| 3) 1)) (.cse36 (< 0 |ULTIMATE.start_main_~main__tokenlen~0#1|)) (.cse37 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 2147483647)) (.cse38 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1|)) (.cse39 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse40 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1|)) (.cse41 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1)) (.cse42 (<= 1 |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse43 (<= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 2147483647)) (.cse44 (<= 0 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 2147483648))) (.cse45 (<= 0 |ULTIMATE.start_main_~__tmp_8~0#1|)) (.cse46 (<= 0 |ULTIMATE.start_main_~__tmp_6~0#1|)) (.cse47 (<= |ULTIMATE.start_main_~__tmp_1~0#1| 1)) (.cse48 (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse49 (= 41 (select |#length| 2))) (.cse50 (= (select |#valid| 1) 1)) (.cse51 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1|)) (.cse52 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1|)) (.cse53 (<= 0 |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1|)) (.cse54 (<= |ULTIMATE.start_main_~__tmp_4~0#1| 1)) (.cse55 (= (select |#valid| 0) 0)) (.cse56 (= (select |#valid| 2) 1)) (.cse57 (= |#NULL.offset| 0)) (.cse58 (= (select .cse69 0) 48)) (.cse59 (<= |ULTIMATE.start_main_~__tmp_2~0#1| 1)) (.cse60 (<= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 1)) (.cse61 (<= 1 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse62 (= (select .cse69 1) 0)) (.cse63 (= ~__return_main~0 0)) (.cse64 (= ~__return_375~0 0)) (.cse65 (<= 0 |ULTIMATE.start_main_~__tmp_10~0#1|)) (.cse66 (< 0 |#StackHeapBarrier|)) (.cse67 (= |#NULL.base| 0)) (.cse68 (<= 0 |ULTIMATE.start_main_~__tmp_2~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 (= |ULTIMATE.start_main_~main__c~0#1| 0) .cse68) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 1 |ULTIMATE.start_main_~main__c~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68)))) [2022-11-26 00:55:44,507 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-11-26 00:55:44,507 INFO L902 garLoopResultBuilder]: At program point L431(lines 13 439) the Hoare annotation is: true [2022-11-26 00:55:44,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 194) no Hoare annotation was computed. [2022-11-26 00:55:44,508 INFO L899 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-11-26 00:55:44,508 INFO L899 garLoopResultBuilder]: For program point L200-1(line 200) no Hoare annotation was computed. [2022-11-26 00:55:44,508 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-11-26 00:55:44,512 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:55:44,514 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:55:44,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:55:44 BoogieIcfgContainer [2022-11-26 00:55:44,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:55:44,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:55:44,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:55:44,591 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:55:44,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:32" (3/4) ... [2022-11-26 00:55:44,594 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:55:44,613 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-26 00:55:44,614 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-26 00:55:44,614 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:55:44,615 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:55:44,694 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:55:44,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:55:44,696 INFO L158 Benchmark]: Toolchain (without parser) took 133208.41ms. Allocated memory was 130.0MB in the beginning and 352.3MB in the end (delta: 222.3MB). Free memory was 101.7MB in the beginning and 155.4MB in the end (delta: -53.8MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. [2022-11-26 00:55:44,697 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:55:44,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.59ms. Allocated memory is still 130.0MB. Free memory was 101.2MB in the beginning and 81.5MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-26 00:55:44,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.55ms. Allocated memory is still 130.0MB. Free memory was 81.5MB in the beginning and 79.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:55:44,698 INFO L158 Benchmark]: Boogie Preprocessor took 33.19ms. Allocated memory is still 130.0MB. Free memory was 79.3MB in the beginning and 77.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:55:44,698 INFO L158 Benchmark]: RCFGBuilder took 740.23ms. Allocated memory is still 130.0MB. Free memory was 77.7MB in the beginning and 57.6MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-26 00:55:44,700 INFO L158 Benchmark]: TraceAbstraction took 131902.04ms. Allocated memory was 130.0MB in the beginning and 352.3MB in the end (delta: 222.3MB). Free memory was 56.8MB in the beginning and 161.7MB in the end (delta: -105.0MB). Peak memory consumption was 172.9MB. Max. memory is 16.1GB. [2022-11-26 00:55:44,700 INFO L158 Benchmark]: Witness Printer took 104.10ms. Allocated memory is still 352.3MB. Free memory was 161.7MB in the beginning and 155.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-26 00:55:44,705 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.59ms. Allocated memory is still 130.0MB. Free memory was 101.2MB in the beginning and 81.5MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.55ms. Allocated memory is still 130.0MB. Free memory was 81.5MB in the beginning and 79.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.19ms. Allocated memory is still 130.0MB. Free memory was 79.3MB in the beginning and 77.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 740.23ms. Allocated memory is still 130.0MB. Free memory was 77.7MB in the beginning and 57.6MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 131902.04ms. Allocated memory was 130.0MB in the beginning and 352.3MB in the end (delta: 222.3MB). Free memory was 56.8MB in the beginning and 161.7MB in the end (delta: -105.0MB). Peak memory consumption was 172.9MB. Max. memory is 16.1GB. * Witness Printer took 104.10ms. Allocated memory is still 352.3MB. Free memory was 161.7MB in the beginning and 155.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 92]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 162]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 162]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 184]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 184]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 200]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 200]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 232]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 232]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 234]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 234]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 314]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 314]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 391]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 391]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 103 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 131.7s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 60.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2872 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2872 mSDsluCounter, 1371 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 700 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2542 IncrementalHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 671 mSDtfsCounter, 2542 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1003 GetRequests, 679 SyntacticMatches, 71 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5875 ImplicationChecksByTransitivity, 99.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=9, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 436 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 81 NumberOfFragments, 2005 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1724 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 6 FomulaSimplificationsInter, 28682 FormulaSimplificationTreeSizeReductionInter, 9.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 970 NumberOfCodeBlocks, 930 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1220 ConstructedInterpolants, 0 QuantifiedInterpolants, 2952 SizeOfPredicates, 5 NumberOfNonLiveVariables, 887 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 22 InterpolantComputations, 9 PerfectInterpolantSequences, 234/482 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 6.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 137, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 269, TOOLS_POST_TIME: 6.0s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 269, TOOLS_QUANTIFIERELIM_TIME: 5.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 430, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 137, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME: 4.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 4.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 6979, DAG_COMPRESSION_RETAINED_NODES: 337, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __tmp_5 && __tmp_9 <= 1) && __tmp_6 <= 1) && 0 <= main____CPAchecker_TMP_0 + 2147483648) && unknown-#length-unknown[3] == 12) && __VERIFIER_assert__cond <= 1) && 0 <= __tmp_7) && 0 <= main____CPAchecker_TMP_2 + 2147483648) && main__scheme <= 1000000) && 0 <= __tmp_3) && 0 <= 1000000 + main__urilen) && main__urilen <= 1000000) && 0 <= main__cp) && main__tokenlen <= 1000000) && __tmp_3 <= 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __tmp_4) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_8 <= 1) && main____CPAchecker_TMP_2 <= 2147483647) && __VERIFIER_assert__cond <= 1) && __tmp_7 <= 1) && __VERIFIER_assert__cond <= 1) && 0 <= __tmp_9) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_10 <= 1) && __tmp_5 <= 1) && 2 == unknown-#length-unknown[1]) && __VERIFIER_assert__cond <= 1) && \valid[3] == 1) && 0 < main__tokenlen) && main____CPAchecker_TMP_1 <= 2147483647) && 0 <= __VERIFIER_assert__cond) && 1 <= main__cp) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && 1 <= main__urilen) && main____CPAchecker_TMP_0 <= 2147483647) && 0 <= main____CPAchecker_TMP_1 + 2147483648) && 0 <= __tmp_8) && 0 <= __tmp_6) && __tmp_1 <= 1) && 0 <= __tmp_1) && 41 == unknown-#length-unknown[2]) && \valid[1] == 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_4 <= 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && __tmp_2 <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__scheme) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && __return_375 == 0) && 0 <= __tmp_10) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && main__c == 0) && 0 <= __tmp_2) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __tmp_5 && __tmp_9 <= 1) && __tmp_6 <= 1) && 0 <= main____CPAchecker_TMP_0 + 2147483648) && unknown-#length-unknown[3] == 12) && __VERIFIER_assert__cond <= 1) && 0 <= __tmp_7) && 0 <= main____CPAchecker_TMP_2 + 2147483648) && main__scheme <= 1000000) && 0 <= __tmp_3) && 0 <= 1000000 + main__urilen) && main__urilen <= 1000000) && 0 <= main__cp) && main__tokenlen <= 1000000) && __tmp_3 <= 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __tmp_4) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_8 <= 1) && main____CPAchecker_TMP_2 <= 2147483647) && __VERIFIER_assert__cond <= 1) && __tmp_7 <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__c) && 0 <= __tmp_9) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_10 <= 1) && __tmp_5 <= 1) && 2 == unknown-#length-unknown[1]) && __VERIFIER_assert__cond <= 1) && \valid[3] == 1) && 0 < main__tokenlen) && main____CPAchecker_TMP_1 <= 2147483647) && 0 <= __VERIFIER_assert__cond) && 1 <= main__cp) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && 1 <= main__urilen) && main____CPAchecker_TMP_0 <= 2147483647) && 0 <= main____CPAchecker_TMP_1 + 2147483648) && 0 <= __tmp_8) && 0 <= __tmp_6) && __tmp_1 <= 1) && 0 <= __tmp_1) && 41 == unknown-#length-unknown[2]) && \valid[1] == 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_4 <= 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && __tmp_2 <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__scheme) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && __return_375 == 0) && 0 <= __tmp_10) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 0 <= __tmp_2) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __tmp_5 && __tmp_9 <= 1) && __tmp_6 <= 1) && 0 <= main____CPAchecker_TMP_0 + 2147483648) && unknown-#length-unknown[3] == 12) && __VERIFIER_assert__cond <= 1) && 0 <= __tmp_7) && 0 <= main____CPAchecker_TMP_2 + 2147483648) && main__scheme <= 1000000) && 0 <= __tmp_3) && 0 <= 1000000 + main__urilen) && main__urilen <= 1000000) && 0 <= main__cp) && main__tokenlen <= 1000000) && __tmp_3 <= 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __tmp_4) && __tmp_11 == (if main__cp < main__urilen then 1 else 0)) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_8 <= 1) && main____CPAchecker_TMP_2 <= 2147483647) && __VERIFIER_assert__cond <= 1) && __tmp_7 <= 1) && __VERIFIER_assert__cond <= 1) && 0 <= __tmp_9) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_12 == (if 0 <= main__cp then 1 else 0)) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_10 <= 1) && __tmp_5 <= 1) && 2 == unknown-#length-unknown[1]) && __VERIFIER_assert__cond <= 1) && !(__VERIFIER_assert__cond == 0)) && \valid[3] == 1) && main____CPAchecker_TMP_1 <= 2147483647) && 0 <= __VERIFIER_assert__cond) && main____CPAchecker_TMP_3 <= 2147483647) && 1 <= main__cp) && 0 <= main____CPAchecker_TMP_3 + 2147483648) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && main____CPAchecker_TMP_0 <= 2147483647) && 0 <= main____CPAchecker_TMP_1 + 2147483648) && main__c + 1 < main__tokenlen) && 0 <= __tmp_8) && 0 <= __tmp_6) && __tmp_1 <= 1) && 0 <= __tmp_1) && 41 == unknown-#length-unknown[2]) && \valid[1] == 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_4 <= 1) && !(main__cp + 1 == main__urilen)) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && __tmp_12 == __VERIFIER_assert__cond) && unknown-#memory_int-unknown[1][0] == 48) && __tmp_2 <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__scheme) && __tmp_11 == __VERIFIER_assert__cond) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && __return_375 == 0) && 0 <= __tmp_10) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && main__c == 0) && 0 <= __tmp_2) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __tmp_5 && __tmp_9 <= 1) && __tmp_6 <= 1) && 0 <= main____CPAchecker_TMP_0 + 2147483648) && unknown-#length-unknown[3] == 12) && __VERIFIER_assert__cond <= 1) && 0 <= __tmp_7) && 0 <= main____CPAchecker_TMP_2 + 2147483648) && main__scheme <= 1000000) && 0 <= __tmp_3) && main__urilen <= 1000000) && main__tokenlen <= 1000000) && __tmp_3 <= 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __tmp_4) && __tmp_11 == (if main__cp < main__urilen then 1 else 0)) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_8 <= 1) && main____CPAchecker_TMP_2 <= 2147483647) && __VERIFIER_assert__cond <= 1) && __tmp_7 <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__c) && 0 <= __tmp_9) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_12 == (if 0 <= main__cp then 1 else 0)) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_10 <= 1) && __tmp_5 <= 1) && 2 == unknown-#length-unknown[1]) && __VERIFIER_assert__cond <= 1) && !(__VERIFIER_assert__cond == 0)) && \valid[3] == 1) && main____CPAchecker_TMP_1 <= 2147483647) && 0 <= __VERIFIER_assert__cond) && main____CPAchecker_TMP_3 <= 2147483647) && 1 <= main__cp) && 0 <= main____CPAchecker_TMP_3 + 2147483648) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && main____CPAchecker_TMP_0 <= 2147483647) && 0 <= main____CPAchecker_TMP_1 + 2147483648) && main__c + 1 < main__tokenlen) && 0 <= __tmp_8) && 0 <= __tmp_6) && __tmp_1 <= 1) && 0 <= __tmp_1) && 41 == unknown-#length-unknown[2]) && \valid[1] == 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_4 <= 1) && !(main__cp + 1 == main__urilen)) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && __tmp_12 == __VERIFIER_assert__cond) && unknown-#memory_int-unknown[1][0] == 48) && __tmp_2 <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__scheme) && __tmp_11 == __VERIFIER_assert__cond) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && __return_375 == 0) && 0 <= __tmp_10) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 0 <= __tmp_2)) || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __tmp_5 && __tmp_9 <= 1) && __tmp_6 <= 1) && 0 <= main____CPAchecker_TMP_0 + 2147483648) && unknown-#length-unknown[3] == 12) && __VERIFIER_assert__cond <= 1) && 0 <= __tmp_7) && 0 <= main____CPAchecker_TMP_2 + 2147483648) && main__scheme <= 1000000) && 0 <= __tmp_3) && 0 <= 1000000 + main__urilen) && main__urilen <= 1000000) && 0 <= main__cp) && main__tokenlen <= 1000000) && __tmp_3 <= 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __tmp_4) && __tmp_11 == (if main__cp < main__urilen then 1 else 0)) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_16 == (if 0 <= main__cp then 1 else 0)) && __tmp_8 <= 1) && main____CPAchecker_TMP_2 <= 2147483647) && __VERIFIER_assert__cond <= 1) && __tmp_7 <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__c) && __tmp_14 == __VERIFIER_assert__cond) && 0 <= __tmp_9) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_12 == (if 0 <= main__cp then 1 else 0)) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_10 <= 1) && __tmp_5 <= 1) && 2 == unknown-#length-unknown[1]) && __VERIFIER_assert__cond <= 1) && __tmp_13 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && \valid[3] == 1) && __tmp_13 == (if main__c < main__tokenlen then 1 else 0)) && main____CPAchecker_TMP_1 <= 2147483647) && 0 <= __VERIFIER_assert__cond) && main____CPAchecker_TMP_3 <= 2147483647) && 1 <= main__cp) && 0 <= main____CPAchecker_TMP_3 + 2147483648) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && main____CPAchecker_TMP_0 <= 2147483647) && 0 <= main____CPAchecker_TMP_1 + 2147483648) && __tmp_14 == (if 0 <= main__c then 1 else 0)) && 0 <= __tmp_8) && 0 <= __tmp_6) && __tmp_1 <= 1) && !(main____CPAchecker_TMP_3 == 0)) && 0 <= __tmp_1) && 41 == unknown-#length-unknown[2]) && \valid[1] == 1) && 0 <= __VERIFIER_assert__cond) && __tmp_15 == __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && __tmp_16 == __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_15 == (if main__cp < main__urilen then 1 else 0)) && __tmp_4 <= 1) && !(main__cp + 1 == main__urilen)) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && __tmp_12 == __VERIFIER_assert__cond) && unknown-#memory_int-unknown[1][0] == 48) && __tmp_2 <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__scheme) && __tmp_11 == __VERIFIER_assert__cond) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && __return_375 == 0) && 0 <= __tmp_10) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 0 <= __tmp_2) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: 0 <= 1000000 + main__urilen - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((__VERIFIER_assert__cond == __tmp_1 && 0 <= main____CPAchecker_TMP_0 + 2147483648) && unknown-#length-unknown[3] == 12) && __VERIFIER_assert__cond == __tmp_2) && main__cp == main__scheme) && __VERIFIER_assert__cond == __tmp_3) && (if 1 <= main__cp then 1 else 0) == __tmp_2) && main__urilen <= 1000000) && main__tokenlen <= 1000000) && (if main__cp < main__urilen + 1 then 1 else 0) == __tmp_1) && 2 == unknown-#length-unknown[1]) && 0 <= main__scheme) && \valid[3] == 1) && 0 < main__tokenlen) && main____CPAchecker_TMP_0 <= 2147483647) && main__scheme + 1 <= main__urilen) && __VERIFIER_assert__cond == __tmp_4) && 41 == unknown-#length-unknown[2]) && \valid[1] == 1) && !(main__scheme == 0)) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && (if main__cp < main__urilen then 1 else 0) == __tmp_3) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && __return_375 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(main____CPAchecker_TMP_0 == 0)) && (if 0 <= main__cp then 1 else 0) == __tmp_4) || ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= main____CPAchecker_TMP_0 + 2147483648 && unknown-#length-unknown[3] == 12) && 0 <= __tmp_3) && 0 <= __tmp_17) && main__urilen <= 1000000) && main__tokenlen <= 1000000) && __tmp_3 <= 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __tmp_4) && 0 <= __tmp_18) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && !(__VERIFIER_assert__cond == 0)) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && 2 == unknown-#length-unknown[1]) && 0 <= main__scheme) && \valid[3] == 1) && 0 < main__tokenlen) && main__scheme <= 999999) && 0 <= __VERIFIER_assert__cond) && __tmp_18 <= 1) && 1 <= main__cp) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__urilen) && main____CPAchecker_TMP_0 <= 2147483647) && __tmp_1 <= 1) && 0 <= __tmp_1) && 41 == unknown-#length-unknown[2]) && \valid[1] == 1) && main____CPAchecker_TMP_1 == 0) && 0 <= __VERIFIER_assert__cond) && !(main__scheme == 0)) && 0 <= __VERIFIER_assert__cond) && __tmp_17 <= 1) && main__cp <= 1000000) && __tmp_4 <= 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && __VERIFIER_assert__cond <= 1) && unknown-#memory_int-unknown[1][0] == 48) && __tmp_2 <= 1) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && __return_375 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && 0 <= __tmp_2) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((((unknown-#length-unknown[3] == 12 && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 0 < main__tokenlen) && main____CPAchecker_TMP_1 <= 2147483647) && 0 <= main____CPAchecker_TMP_1 + 2147483648) && 41 == unknown-#length-unknown[2]) && \valid[1] == 1) && !(main__scheme == 0)) && main__cp <= 1000000) && \valid[0] == 0) && ((((((((((((((((((((((0 <= main____CPAchecker_TMP_0 + 2147483648 && !(__VERIFIER_assert__cond == 0)) && main__cp == main__scheme) && !(__VERIFIER_assert__cond == 0)) && (if 1 <= main__cp then 1 else 0) == __tmp_2) && main__urilen <= 1000000) && main__tokenlen <= 1000000) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && (if main__cp < main__urilen + 1 then 1 else 0) == __tmp_1) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && 0 <= main__scheme) && 0 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen < main__scheme + 1)) && __VERIFIER_assert__cond <= 1) && main____CPAchecker_TMP_0 <= 2147483647) && __VERIFIER_assert__cond == __tmp_4) && (if main__cp < main__urilen then 1 else 0) == __tmp_3) && !(main____CPAchecker_TMP_0 == 0)) && (if 0 <= main__cp then 1 else 0) == __tmp_4) || (((((((((((((((((((((((((((((((0 <= main____CPAchecker_TMP_0 + 2147483648 && 0 <= __tmp_3) && 0 <= __tmp_17) && main__urilen <= 1000000) && main__tokenlen <= 1000000) && __tmp_3 <= 1) && 0 <= __VERIFIER_assert__cond) && 0 <= __tmp_4) && 0 <= __tmp_18) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && !(__VERIFIER_assert__cond == 0)) && 0 <= __VERIFIER_assert__cond) && __VERIFIER_assert__cond <= 1) && 0 <= main__scheme) && main__scheme <= 999999) && 0 <= __VERIFIER_assert__cond) && __tmp_18 <= 1) && 1 <= main__cp) && __VERIFIER_assert__cond <= 1) && __VERIFIER_assert__cond <= 1) && 1 <= main__urilen) && main____CPAchecker_TMP_0 <= 2147483647) && __tmp_1 <= 1) && 0 <= __tmp_1) && 0 <= __VERIFIER_assert__cond) && 0 <= __VERIFIER_assert__cond) && __tmp_17 <= 1) && __tmp_4 <= 1) && __VERIFIER_assert__cond <= 1) && __tmp_2 <= 1))) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && __return_375 == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && !(main____CPAchecker_TMP_1 == 0)) && 0 <= __tmp_2) || ((((main__scheme <= 1000000 && 0 <= main__cp) && 0 <= main__scheme) && main__cp <= 999999) && main__cp + 1 == main__urilen) RESULT: Ultimate proved your program to be correct! [2022-11-26 00:55:44,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c44c37aa-eb15-46d2-ac1e-5f4a19f26b19/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE