./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh --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 64bit --witnessprinter.graph.data.programhash ef81808dbabc5963dd9b655eb43a7ab624abda13c0587648533de73800c0fdb5 --- 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-2329fc7 [2022-12-14 12:00:21,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:00:21,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:00:21,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:00:21,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:00:21,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:00:21,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:00:21,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:00:21,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:00:21,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:00:21,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:00:21,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:00:21,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:00:21,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:00:21,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:00:21,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:00:21,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:00:21,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:00:21,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:00:21,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:00:21,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:00:21,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:00:21,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:00:21,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:00:21,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:00:21,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:00:21,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:00:21,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:00:21,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:00:21,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:00:21,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:00:21,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:00:21,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:00:21,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:00:21,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:00:21,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:00:21,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:00:21,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:00:21,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:00:21,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:00:21,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:00:21,759 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 12:00:21,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:00:21,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:00:21,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:00:21,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:00:21,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:00:21,780 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:00:21,780 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:00:21,780 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:00:21,780 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:00:21,780 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 12:00:21,781 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:00:21,781 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:00:21,781 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 12:00:21,781 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 12:00:21,781 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:00:21,781 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 12:00:21,782 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 12:00:21,782 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 12:00:21,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:00:21,782 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 12:00:21,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 12:00:21,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:00:21,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 12:00:21,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:00:21,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 12:00:21,783 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 12:00:21,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 12:00:21,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:00:21,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 12:00:21,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:00:21,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:00:21,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:00:21,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:00:21,785 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 12:00:21,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:00:21,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 12:00:21,785 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 12:00:21,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 12:00:21,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 12:00:21,785 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:00:21,785 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_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/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_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef81808dbabc5963dd9b655eb43a7ab624abda13c0587648533de73800c0fdb5 [2022-12-14 12:00:21,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:00:21,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:00:21,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:00:21,989 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:00:21,990 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:00:21,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_11_good.i [2022-12-14 12:00:24,484 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:00:24,719 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:00:24,720 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_add_11_good.i [2022-12-14 12:00:24,731 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/data/f994e29ed/e55dc433e3264803b2b97d1227be1573/FLAGcae731f4b [2022-12-14 12:00:25,033 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/data/f994e29ed/e55dc433e3264803b2b97d1227be1573 [2022-12-14 12:00:25,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:00:25,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:00:25,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:00:25,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:00:25,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:00:25,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e4df57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25, skipping insertion in model container [2022-12-14 12:00:25,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:00:25,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:00:25,293 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 12:00:25,608 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 12:00:25,612 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 12:00:25,613 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 12:00:25,615 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 12:00:25,615 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 12:00:25,632 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 12:00:25,637 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 12:00:25,643 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 12:00:25,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:00:25,651 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:00:25,664 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 12:00:25,691 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 12:00:25,692 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 12:00:25,693 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 12:00:25,695 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 12:00:25,695 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 12:00:25,699 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 12:00:25,701 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 12:00:25,704 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 12:00:25,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:00:25,805 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:00:25,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25 WrapperNode [2022-12-14 12:00:25,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:00:25,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:00:25,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:00:25,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:00:25,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,848 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2022-12-14 12:00:25,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:00:25,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:00:25,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:00:25,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:00:25,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,864 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:00:25,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:00:25,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:00:25,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:00:25,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (1/1) ... [2022-12-14 12:00:25,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:00:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:25,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:00:25,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:00:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-14 12:00:25,918 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-14 12:00:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-12-14 12:00:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-14 12:00:25,918 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-14 12:00:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-12-14 12:00:25,918 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-12-14 12:00:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 12:00:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-14 12:00:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:00:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:00:25,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:00:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 12:00:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-12-14 12:00:25,919 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-12-14 12:00:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-14 12:00:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 12:00:26,030 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:00:26,031 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:00:26,182 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:00:26,204 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:00:26,204 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 12:00:26,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:00:26 BoogieIcfgContainer [2022-12-14 12:00:26,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:00:26,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:00:26,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:00:26,210 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:00:26,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:00:25" (1/3) ... [2022-12-14 12:00:26,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197eed60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:00:26, skipping insertion in model container [2022-12-14 12:00:26,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:00:25" (2/3) ... [2022-12-14 12:00:26,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197eed60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:00:26, skipping insertion in model container [2022-12-14 12:00:26,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:00:26" (3/3) ... [2022-12-14 12:00:26,212 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_add_11_good.i [2022-12-14 12:00:26,225 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:00:26,225 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 12:00:26,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:00:26,264 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;@3edfcd3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:00:26,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 12:00:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 12:00:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 12:00:26,273 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:26,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:26,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1416833960, now seen corresponding path program 1 times [2022-12-14 12:00:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:26,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701440554] [2022-12-14 12:00:26,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:26,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:00:26,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:26,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701440554] [2022-12-14 12:00:26,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701440554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:26,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:26,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 12:00:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383927012] [2022-12-14 12:00:26,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:26,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:00:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:00:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:00:26,513 INFO L87 Difference]: Start difference. First operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:00:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:26,576 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-12-14 12:00:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:00:26,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-12-14 12:00:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:26,584 INFO L225 Difference]: With dead ends: 137 [2022-12-14 12:00:26,584 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 12:00:26,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:00:26,588 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:26,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 12:00:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-14 12:00:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 53 states have internal predecessors, (54), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 12:00:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-12-14 12:00:26,628 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-12-14 12:00:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:26,629 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-12-14 12:00:26,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:00:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-12-14 12:00:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 12:00:26,630 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:26,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:00:26,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 12:00:26,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:26,631 INFO L85 PathProgramCache]: Analyzing trace with hash -662147571, now seen corresponding path program 1 times [2022-12-14 12:00:26,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:26,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777424481] [2022-12-14 12:00:26,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:00:26,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:26,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777424481] [2022-12-14 12:00:26,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777424481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:26,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:26,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:00:26,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830995392] [2022-12-14 12:00:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:26,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:00:26,712 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:00:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:26,740 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-12-14 12:00:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2022-12-14 12:00:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:26,743 INFO L225 Difference]: With dead ends: 68 [2022-12-14 12:00:26,743 INFO L226 Difference]: Without dead ends: 67 [2022-12-14 12:00:26,743 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-12-14 12:00:26,744 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:26,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 97 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-14 12:00:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-14 12:00:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.394736842105263) internal successors, (53), 52 states have internal predecessors, (53), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 12:00:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-12-14 12:00:26,753 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 19 [2022-12-14 12:00:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:26,753 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-12-14 12:00:26,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 12:00:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-12-14 12:00:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 12:00:26,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:26,754 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] [2022-12-14 12:00:26,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 12:00:26,754 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash 948261856, now seen corresponding path program 1 times [2022-12-14 12:00:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:26,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539565001] [2022-12-14 12:00:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:00:26,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:26,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539565001] [2022-12-14 12:00:26,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539565001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:26,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:26,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:00:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200244824] [2022-12-14 12:00:26,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:26,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:26,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:26,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:00:26,798 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 12:00:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:26,834 INFO L93 Difference]: Finished difference Result 162 states and 217 transitions. [2022-12-14 12:00:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-12-14 12:00:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:26,836 INFO L225 Difference]: With dead ends: 162 [2022-12-14 12:00:26,836 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 12:00:26,837 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-12-14 12:00:26,837 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:26,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:26,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 12:00:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 71. [2022-12-14 12:00:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 54 states have internal predecessors, (57), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-12-14 12:00:26,848 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 20 [2022-12-14 12:00:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:26,848 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-12-14 12:00:26,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 12:00:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-12-14 12:00:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 12:00:26,849 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:26,849 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:00:26,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 12:00:26,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:26,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2023098508, now seen corresponding path program 1 times [2022-12-14 12:00:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:26,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463459617] [2022-12-14 12:00:26,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 12:00:26,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:26,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463459617] [2022-12-14 12:00:26,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463459617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:26,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:26,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 12:00:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555005285] [2022-12-14 12:00:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:26,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:00:26,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:26,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:00:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:00:26,912 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:00:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:26,946 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2022-12-14 12:00:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:00:26,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 33 [2022-12-14 12:00:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:26,948 INFO L225 Difference]: With dead ends: 119 [2022-12-14 12:00:26,948 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 12:00:26,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 12:00:26,950 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:26,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 12:00:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-12-14 12:00:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 53 states have internal predecessors, (55), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 12:00:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-12-14 12:00:26,962 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 33 [2022-12-14 12:00:26,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:26,962 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-12-14 12:00:26,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:00:26,963 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-12-14 12:00:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 12:00:26,964 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:26,964 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:00:26,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 12:00:26,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1123908321, now seen corresponding path program 1 times [2022-12-14 12:00:26,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:26,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808900687] [2022-12-14 12:00:26,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:26,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:27,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:27,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808900687] [2022-12-14 12:00:27,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808900687] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:27,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032552557] [2022-12-14 12:00:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:27,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:27,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 12:00:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:27,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:00:27,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 12:00:27,177 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:00:27,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032552557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:27,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:00:27,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 12:00:27,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801153434] [2022-12-14 12:00:27,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:27,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:27,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:27,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:27,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:27,179 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:00:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:27,217 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2022-12-14 12:00:27,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:27,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-12-14 12:00:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:27,219 INFO L225 Difference]: With dead ends: 102 [2022-12-14 12:00:27,219 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 12:00:27,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:27,221 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:27,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 177 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 12:00:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2022-12-14 12:00:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 57 states have internal predecessors, (62), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2022-12-14 12:00:27,234 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 34 [2022-12-14 12:00:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:27,234 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2022-12-14 12:00:27,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:00:27,235 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2022-12-14 12:00:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 12:00:27,236 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:27,236 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:00:27,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 12:00:27,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:27,438 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:27,440 INFO L85 PathProgramCache]: Analyzing trace with hash 481419694, now seen corresponding path program 1 times [2022-12-14 12:00:27,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:27,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574573219] [2022-12-14 12:00:27,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:27,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 12:00:27,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:27,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574573219] [2022-12-14 12:00:27,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574573219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:27,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460836723] [2022-12-14 12:00:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:27,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:27,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:27,616 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:27,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 12:00:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:27,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:00:27,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 12:00:27,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:00:27,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460836723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:27,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:00:27,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 12:00:27,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261953894] [2022-12-14 12:00:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:27,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:27,719 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:00:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:27,747 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2022-12-14 12:00:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:27,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 35 [2022-12-14 12:00:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:27,748 INFO L225 Difference]: With dead ends: 134 [2022-12-14 12:00:27,748 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 12:00:27,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:27,749 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 23 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:27,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 155 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 12:00:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2022-12-14 12:00:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2022-12-14 12:00:27,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 35 [2022-12-14 12:00:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:27,756 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2022-12-14 12:00:27,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:00:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-12-14 12:00:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 12:00:27,757 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:27,757 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:00:27,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 12:00:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 12:00:27,958 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:27,959 INFO L85 PathProgramCache]: Analyzing trace with hash 609191078, now seen corresponding path program 1 times [2022-12-14 12:00:27,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:27,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657256533] [2022-12-14 12:00:27,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:27,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 12:00:28,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:28,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657256533] [2022-12-14 12:00:28,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657256533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:28,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:28,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:00:28,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894093091] [2022-12-14 12:00:28,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:28,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:00:28,066 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:00:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:28,103 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-12-14 12:00:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:28,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-12-14 12:00:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:28,105 INFO L225 Difference]: With dead ends: 77 [2022-12-14 12:00:28,105 INFO L226 Difference]: Without dead ends: 76 [2022-12-14 12:00:28,105 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-12-14 12:00:28,106 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:28,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 108 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-14 12:00:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-14 12:00:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 57 states have internal predecessors, (61), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-12-14 12:00:28,113 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 36 [2022-12-14 12:00:28,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:28,113 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-12-14 12:00:28,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 12:00:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-12-14 12:00:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 12:00:28,114 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:28,114 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-12-14 12:00:28,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 12:00:28,115 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1705054345, now seen corresponding path program 1 times [2022-12-14 12:00:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:28,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221141511] [2022-12-14 12:00:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:28,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 12:00:28,146 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:28,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221141511] [2022-12-14 12:00:28,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221141511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:28,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:00:28,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:00:28,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114551540] [2022-12-14 12:00:28,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:28,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:28,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:28,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:28,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:00:28,148 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:00:28,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:28,170 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2022-12-14 12:00:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:28,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2022-12-14 12:00:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:28,171 INFO L225 Difference]: With dead ends: 99 [2022-12-14 12:00:28,171 INFO L226 Difference]: Without dead ends: 98 [2022-12-14 12:00:28,172 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-12-14 12:00:28,172 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 27 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:28,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 165 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-14 12:00:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2022-12-14 12:00:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 54 states have internal predecessors, (58), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:28,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2022-12-14 12:00:28,179 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 37 [2022-12-14 12:00:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:28,179 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2022-12-14 12:00:28,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 12:00:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2022-12-14 12:00:28,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 12:00:28,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:28,180 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-12-14 12:00:28,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 12:00:28,181 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:28,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:28,181 INFO L85 PathProgramCache]: Analyzing trace with hash 936930068, now seen corresponding path program 1 times [2022-12-14 12:00:28,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:28,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613265795] [2022-12-14 12:00:28,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 12:00:28,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613265795] [2022-12-14 12:00:28,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613265795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042602124] [2022-12-14 12:00:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:28,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:28,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:28,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 12:00:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:28,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:00:28,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 12:00:28,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:00:28,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042602124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:28,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:00:28,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 12:00:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800793296] [2022-12-14 12:00:28,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:28,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:28,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:28,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:28,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:28,323 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 12:00:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:28,349 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2022-12-14 12:00:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:28,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 44 [2022-12-14 12:00:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:28,351 INFO L225 Difference]: With dead ends: 90 [2022-12-14 12:00:28,351 INFO L226 Difference]: Without dead ends: 89 [2022-12-14 12:00:28,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:28,352 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:28,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-14 12:00:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2022-12-14 12:00:28,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 56 states have internal predecessors, (62), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 12:00:28,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2022-12-14 12:00:28,363 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 44 [2022-12-14 12:00:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:28,363 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-12-14 12:00:28,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 12:00:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2022-12-14 12:00:28,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 12:00:28,365 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:28,365 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-12-14 12:00:28,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 12:00:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:28,566 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1019938826, now seen corresponding path program 1 times [2022-12-14 12:00:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:28,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892813770] [2022-12-14 12:00:28,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 12:00:28,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:28,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892813770] [2022-12-14 12:00:28,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892813770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:28,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282987151] [2022-12-14 12:00:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:28,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:28,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:28,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:00:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:00:28,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 12:00:28,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:00:28,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282987151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:28,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:00:28,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 12:00:28,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017202440] [2022-12-14 12:00:28,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:28,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:28,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:28,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:28,715 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 12:00:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:28,734 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-12-14 12:00:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:28,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 45 [2022-12-14 12:00:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:28,735 INFO L225 Difference]: With dead ends: 77 [2022-12-14 12:00:28,735 INFO L226 Difference]: Without dead ends: 76 [2022-12-14 12:00:28,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:28,736 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:28,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-14 12:00:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-14 12:00:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 55 states have internal predecessors, (61), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 12:00:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2022-12-14 12:00:28,747 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 45 [2022-12-14 12:00:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:28,747 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-12-14 12:00:28,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 12:00:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2022-12-14 12:00:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 12:00:28,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:28,748 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 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] [2022-12-14 12:00:28,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 12:00:28,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 12:00:28,949 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2130642260, now seen corresponding path program 1 times [2022-12-14 12:00:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:28,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581973538] [2022-12-14 12:00:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 12:00:29,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:29,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581973538] [2022-12-14 12:00:29,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581973538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:29,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216677086] [2022-12-14 12:00:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:29,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:29,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:29,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:29,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 12:00:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 12:00:29,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 12:00:29,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:00:29,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216677086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:29,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:00:29,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 12:00:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539566201] [2022-12-14 12:00:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:29,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:00:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:29,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:00:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:29,116 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 12:00:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:29,134 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-12-14 12:00:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:00:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 47 [2022-12-14 12:00:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:29,135 INFO L225 Difference]: With dead ends: 76 [2022-12-14 12:00:29,135 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 12:00:29,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 12:00:29,136 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:29,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 12:00:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-12-14 12:00:29,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 52 states have internal predecessors, (56), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-12-14 12:00:29,142 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 47 [2022-12-14 12:00:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:29,143 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-12-14 12:00:29,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 12:00:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-12-14 12:00:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 12:00:29,144 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:29,144 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 12:00:29,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 12:00:29,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:29,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:29,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1651892317, now seen corresponding path program 1 times [2022-12-14 12:00:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:29,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181054050] [2022-12-14 12:00:29,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 12:00:29,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:29,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181054050] [2022-12-14 12:00:29,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181054050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:29,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834245225] [2022-12-14 12:00:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:29,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:29,396 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:29,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 12:00:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:00:29,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 12:00:29,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:00:29,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834245225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:29,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:00:29,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 12:00:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193967065] [2022-12-14 12:00:29,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:29,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:00:29,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:29,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:00:29,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:00:29,498 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 12:00:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:29,528 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-12-14 12:00:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:00:29,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 54 [2022-12-14 12:00:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:29,529 INFO L225 Difference]: With dead ends: 107 [2022-12-14 12:00:29,530 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 12:00:29,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:00:29,530 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:29,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 12:00:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-14 12:00:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-12-14 12:00:29,539 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 54 [2022-12-14 12:00:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:29,539 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-12-14 12:00:29,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 12:00:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-12-14 12:00:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 12:00:29,540 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:29,540 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 12:00:29,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 12:00:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:29,741 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2032031138, now seen corresponding path program 1 times [2022-12-14 12:00:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:29,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335544751] [2022-12-14 12:00:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 12:00:29,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:29,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335544751] [2022-12-14 12:00:29,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335544751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:29,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002537724] [2022-12-14 12:00:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:29,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:29,861 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:29,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:00:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:29,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:00:29,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 12:00:29,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:00:29,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002537724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:29,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:00:29,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 12:00:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776196802] [2022-12-14 12:00:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:29,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:00:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:00:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:00:29,958 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 12:00:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:29,988 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-12-14 12:00:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:00:29,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 56 [2022-12-14 12:00:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:29,989 INFO L225 Difference]: With dead ends: 100 [2022-12-14 12:00:29,989 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 12:00:29,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:00:29,990 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:29,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 12:00:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-14 12:00:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 51 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2022-12-14 12:00:29,995 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 56 [2022-12-14 12:00:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:29,995 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2022-12-14 12:00:29,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 12:00:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-12-14 12:00:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 12:00:29,996 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:29,996 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 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] [2022-12-14 12:00:30,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 12:00:30,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 12:00:30,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:30,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:30,199 INFO L85 PathProgramCache]: Analyzing trace with hash -126647539, now seen corresponding path program 1 times [2022-12-14 12:00:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:30,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969763543] [2022-12-14 12:00:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:30,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:00:30,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:30,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969763543] [2022-12-14 12:00:30,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969763543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:30,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692420591] [2022-12-14 12:00:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:30,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:30,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:30,361 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:30,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 12:00:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:30,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:00:30,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 12:00:30,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:00:30,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692420591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:30,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:00:30,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 12:00:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729399281] [2022-12-14 12:00:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:30,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 12:00:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 12:00:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:00:30,468 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-14 12:00:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:30,495 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2022-12-14 12:00:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 12:00:30,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2022-12-14 12:00:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:30,496 INFO L225 Difference]: With dead ends: 83 [2022-12-14 12:00:30,496 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 12:00:30,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:00:30,497 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:30,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:00:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 12:00:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-14 12:00:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 50 states have internal predecessors, (52), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 12:00:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-12-14 12:00:30,508 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 60 [2022-12-14 12:00:30,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:30,508 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-12-14 12:00:30,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-14 12:00:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-12-14 12:00:30,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 12:00:30,509 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:30,509 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 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] [2022-12-14 12:00:30,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 12:00:30,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 12:00:30,710 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1944391579, now seen corresponding path program 1 times [2022-12-14 12:00:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:30,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706495275] [2022-12-14 12:00:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:00:30,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:30,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706495275] [2022-12-14 12:00:30,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706495275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991125898] [2022-12-14 12:00:30,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:30,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:30,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:30,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 12:00:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:30,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 12:00:30,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:30,891 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:00:30,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:00:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:00:30,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991125898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:00:30,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1425002893] [2022-12-14 12:00:30,977 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-12-14 12:00:30,977 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:00:30,979 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:00:30,983 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:00:30,984 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:00:31,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:31,333 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 12:00:31,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 12:00:31,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:00:31,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:31,389 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 12:00:31,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 12:00:31,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:31,535 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 12:00:31,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 12:00:31,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:00:31,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:31,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 12:00:32,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,333 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 12:00:32,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 12:00:32,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,512 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 12:00:32,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 12:00:32,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,545 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 12:00:32,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 12:00:32,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:00:32,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:00:32,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:32,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 12:00:34,458 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 12:00:34,460 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-12-14 12:00:34,487 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 12:00:34,567 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-12-14 12:00:34,570 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:00:41,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1425002893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:00:41,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:00:41,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-12-14 12:00:41,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379225057] [2022-12-14 12:00:41,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:00:41,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:00:41,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:00:41,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:00:41,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 12:00:41,480 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 12:00:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:00:46,744 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2022-12-14 12:00:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 12:00:46,745 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 65 [2022-12-14 12:00:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:00:46,746 INFO L225 Difference]: With dead ends: 200 [2022-12-14 12:00:46,746 INFO L226 Difference]: Without dead ends: 156 [2022-12-14 12:00:46,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=286, Invalid=1876, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 12:00:46,747 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 118 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-12-14 12:00:46,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 786 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-12-14 12:00:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-12-14 12:00:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 110. [2022-12-14 12:00:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 76 states have internal predecessors, (78), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-12-14 12:00:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2022-12-14 12:00:46,772 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 65 [2022-12-14 12:00:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:00:46,772 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2022-12-14 12:00:46,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 12:00:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2022-12-14 12:00:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 12:00:46,773 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:00:46,774 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 12:00:46,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 12:00:46,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 12:00:46,976 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:00:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:00:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2046553038, now seen corresponding path program 1 times [2022-12-14 12:00:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:00:46,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196398398] [2022-12-14 12:00:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:00:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:00:47,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:00:47,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196398398] [2022-12-14 12:00:47,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196398398] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:00:47,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039576763] [2022-12-14 12:00:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:00:47,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:00:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:00:47,078 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:00:47,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 12:00:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:00:47,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 12:00:47,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:00:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:00:47,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:00:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:00:47,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039576763] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:00:47,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1854217993] [2022-12-14 12:00:47,231 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 12:00:47,231 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:00:47,231 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:00:47,231 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:00:47,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:00:47,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:00:47,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:47,480 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 12:00:47,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 12:00:47,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:47,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 12:00:47,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:47,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 12:00:47,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:00:47,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:47,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 12:00:48,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:00:48,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:00:48,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,136 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 12:00:48,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 12:00:48,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,183 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 12:00:48,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 12:00:48,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,223 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 12:00:48,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-12-14 12:00:48,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:00:48,364 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 12:00:48,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-12-14 12:00:56,049 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 12:00:56,050 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 33 for LOIs [2022-12-14 12:00:56,052 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-12-14 12:00:56,054 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 12:00:56,139 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:01:11,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1854217993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:01:11,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:11,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-12-14 12:01:11,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822881173] [2022-12-14 12:01:11,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:01:11,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:01:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:11,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:01:11,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 12:01:11,457 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 12:01:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:18,504 INFO L93 Difference]: Finished difference Result 177 states and 215 transitions. [2022-12-14 12:01:18,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 12:01:18,504 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-12-14 12:01:18,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:18,505 INFO L225 Difference]: With dead ends: 177 [2022-12-14 12:01:18,505 INFO L226 Difference]: Without dead ends: 91 [2022-12-14 12:01:18,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 153 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=414, Invalid=2448, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 12:01:18,506 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 82 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:18,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 284 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 12:01:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-14 12:01:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2022-12-14 12:01:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 51 states have internal predecessors, (52), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-14 12:01:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2022-12-14 12:01:18,517 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 67 [2022-12-14 12:01:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:18,518 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2022-12-14 12:01:18,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 12:01:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2022-12-14 12:01:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 12:01:18,518 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:18,518 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 12:01:18,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 12:01:18,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:18,720 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:01:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:18,721 INFO L85 PathProgramCache]: Analyzing trace with hash -458642972, now seen corresponding path program 1 times [2022-12-14 12:01:18,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:18,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831327313] [2022-12-14 12:01:18,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:18,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:01:18,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:18,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831327313] [2022-12-14 12:01:18,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831327313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:18,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113228784] [2022-12-14 12:01:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:18,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:18,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:18,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:18,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 12:01:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:18,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 12:01:18,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:01:18,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 12:01:18,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113228784] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:18,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1655891920] [2022-12-14 12:01:18,966 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 12:01:18,966 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:01:18,967 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:01:18,967 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:01:18,967 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:01:19,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:01:19,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:01:19,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,134 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 12:01:19,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 12:01:19,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,219 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 12:01:19,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 12:01:19,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,331 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 12:01:19,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 12:01:19,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 12:01:19,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,973 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 12:01:19,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 12:01:19,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:19,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:20,110 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 12:01:20,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 12:01:20,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:20,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:20,140 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 12:01:20,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 12:01:20,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:01:20,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:01:20,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:20,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 12:01:21,958 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 12:01:21,960 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-12-14 12:01:22,054 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 12:01:22,135 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 12:01:22,212 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:01:32,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1655891920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:01:32,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:32,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-12-14 12:01:32,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694636948] [2022-12-14 12:01:32,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:01:32,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 12:01:32,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:32,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 12:01:32,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 12:01:32,980 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 12:01:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:01:46,293 INFO L93 Difference]: Finished difference Result 239 states and 291 transitions. [2022-12-14 12:01:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-14 12:01:46,293 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-12-14 12:01:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:01:46,294 INFO L225 Difference]: With dead ends: 239 [2022-12-14 12:01:46,294 INFO L226 Difference]: Without dead ends: 174 [2022-12-14 12:01:46,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=601, Invalid=3689, Unknown=0, NotChecked=0, Total=4290 [2022-12-14 12:01:46,295 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 156 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-12-14 12:01:46,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 828 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-12-14 12:01:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-12-14 12:01:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 73. [2022-12-14 12:01:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 12:01:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-12-14 12:01:46,316 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 67 [2022-12-14 12:01:46,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:01:46,317 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-12-14 12:01:46,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 12:01:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-12-14 12:01:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 12:01:46,317 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:01:46,317 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 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-12-14 12:01:46,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 12:01:46,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 12:01:46,519 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 12:01:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:01:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash -670351301, now seen corresponding path program 1 times [2022-12-14 12:01:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:01:46,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24910645] [2022-12-14 12:01:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:46,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:01:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:01:46,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:01:46,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24910645] [2022-12-14 12:01:46,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24910645] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:01:46,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898639265] [2022-12-14 12:01:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:01:46,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:01:46,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:01:46,595 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:01:46,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 12:01:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:01:46,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 12:01:46,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:01:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:01:46,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:01:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 12:01:46,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898639265] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:01:46,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [887022059] [2022-12-14 12:01:46,761 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 12:01:46,761 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 12:01:46,761 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 12:01:46,761 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 12:01:46,761 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 12:01:46,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,014 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 12:01:47,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 12:01:47,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,170 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 12:01:47,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 12:01:47,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:01:47,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 12:01:47,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:01:47,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 12:01:47,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,934 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 12:01:47,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 12:01:47,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:47,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:48,146 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 12:01:48,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 12:01:48,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:48,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:48,190 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 12:01:48,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 12:01:48,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:01:48,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 12:01:48,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:01:48,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 12:01:50,326 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 12:01:50,328 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 33 for LOIs [2022-12-14 12:01:50,330 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 12:01:50,418 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 12:01:50,426 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 12:01:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [887022059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:01:59,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:01:59,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-12-14 12:01:59,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904770104] [2022-12-14 12:01:59,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:01:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 12:01:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:01:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 12:01:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 12:01:59,553 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 12:02:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:02:18,330 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2022-12-14 12:02:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-12-14 12:02:18,331 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2022-12-14 12:02:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:02:18,331 INFO L225 Difference]: With dead ends: 183 [2022-12-14 12:02:18,331 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 12:02:18,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 164 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=1131, Invalid=6525, Unknown=0, NotChecked=0, Total=7656 [2022-12-14 12:02:18,333 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 2977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:02:18,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 265 Invalid, 2977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-12-14 12:02:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 12:02:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 12:02:18,333 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-12-14 12:02:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 12:02:18,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-12-14 12:02:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:02:18,334 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 12:02:18,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 12:02:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 12:02:18,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 12:02:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 12:02:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 12:02:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 12:02:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 12:02:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 12:02:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 12:02:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 12:02:18,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 12:02:18,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 12:02:18,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 12:02:18,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 12:02:47,029 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-14 12:02:47,029 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-14 12:02:47,029 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1514 1517) the Hoare annotation is: true [2022-12-14 12:02:47,029 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-12-14 12:02:47,029 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-14 12:02:47,029 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-14 12:02:47,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2022-12-14 12:02:47,029 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-12-14 12:02:47,029 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-12-14 12:02:47,030 INFO L902 garLoopResultBuilder]: At program point L1662-1(line 1662) the Hoare annotation is: true [2022-12-14 12:02:47,030 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-12-14 12:02:47,030 INFO L902 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: true [2022-12-14 12:02:47,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2022-12-14 12:02:47,030 INFO L895 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: (let ((.cse57 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse11 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse44 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse57 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse37 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse41 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse55 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse58 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse36 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse56 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= (select |#length| 8) 54)) (.cse47 (= 5 ~globalFive~0)) (.cse48 (<= 3 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse49 (= (select |#valid| 10) 1)) (.cse50 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse51 (= (select |#valid| 8) 1)) (.cse52 (< 0 |#StackHeapBarrier|)) (.cse53 (= |#NULL.base| 0)) (.cse54 (= ~globalTrue~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) (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse38 .cse39 .cse40 .cse56 .cse42 .cse43 .cse44 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse57) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse45 .cse46 .cse47 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse58 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse57) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse55 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse58 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse56 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54)))) [2022-12-14 12:02:47,030 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2022-12-14 12:02:47,030 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2022-12-14 12:02:47,030 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2022-12-14 12:02:47,030 INFO L899 garLoopResultBuilder]: For program point L1605-1(line 1605) no Hoare annotation was computed. [2022-12-14 12:02:47,031 INFO L895 garLoopResultBuilder]: At program point L1638-4(lines 1638 1641) the Hoare annotation is: (let ((.cse42 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse11 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse41 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse52 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse42 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse53 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse58 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse54 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse40 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse57 (<= 3 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) .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 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse42) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse52 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse53 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse54 .cse33 .cse55 .cse34 .cse35 .cse36 .cse56 .cse38 .cse39 .cse40 .cse41 .cse43 .cse44 .cse45 .cse57 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse52 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse53 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse58 .cse29 .cse30 .cse31 .cse32 .cse54 .cse33 .cse55 .cse34 .cse35 .cse36 .cse56 .cse38 .cse39 .cse40 .cse43 .cse44 .cse45 .cse57 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse42) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse58 .cse29 .cse30 .cse31 .cse32 .cse54 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse43 .cse44 .cse45 .cse57 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-12-14 12:02:47,031 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-12-14 12:02:47,031 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse56 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse53 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse54 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse56 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse55 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= |ULTIMATE.start_goodG2B1_~result~2#1| (+ |ULTIMATE.start_goodG2B1_~data~2#1| 1))) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse52 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse54 .cse41 .cse42 .cse55 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse56) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse56) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse54 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse52 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse55 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-12-14 12:02:47,032 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse11 (= (select |#memory_int| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.offset| 0))) (.cse12 (= (select (select |#memory_int| 1) 0) 0)) (.cse13 (= ~globalArgv~0.offset 0)) (.cse14 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse16 (= (select |#valid| 3) 1)) (.cse17 (= 21 (select |#length| 4))) (.cse18 (= (select |#valid| 7) 1)) (.cse19 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= (select |#length| 10) 18)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= (select |#length| 8) 54)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse23 .cse24 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse37 .cse38 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|) .cse39 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point L1597-1(lines 1591 1598) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1633) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483646)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse13 (store ((as const (Array Int Int)) 0) 0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse13 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse35 .cse36 .cse37 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse13) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1581) no Hoare annotation was computed. [2022-12-14 12:02:47,032 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1598) no Hoare annotation was computed. [2022-12-14 12:02:47,033 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1613) no Hoare annotation was computed. [2022-12-14 12:02:47,033 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483646) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 12:02:47,033 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2022-12-14 12:02:47,033 INFO L899 garLoopResultBuilder]: For program point L1642-1(lines 1642 1648) no Hoare annotation was computed. [2022-12-14 12:02:47,033 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1649) no Hoare annotation was computed. [2022-12-14 12:02:47,033 INFO L899 garLoopResultBuilder]: For program point L1601(line 1601) no Hoare annotation was computed. [2022-12-14 12:02:47,033 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-12-14 12:02:47,033 INFO L899 garLoopResultBuilder]: For program point L1601-1(lines 1601 1612) no Hoare annotation was computed. [2022-12-14 12:02:47,033 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-12-14 12:02:47,034 INFO L899 garLoopResultBuilder]: For program point L1626(line 1626) no Hoare annotation was computed. [2022-12-14 12:02:47,034 INFO L899 garLoopResultBuilder]: For program point L1626-1(lines 1626 1632) no Hoare annotation was computed. [2022-12-14 12:02:47,034 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (let ((.cse52 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse14 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse52 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse22 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse54 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse36 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse18 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse20 (= (select |#length| 10) 18)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse53 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse55 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse52) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse53 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse54 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse55 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse54 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse53 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse55 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse52) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-12-14 12:02:47,034 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-12-14 12:02:47,034 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 12:02:47,035 INFO L899 garLoopResultBuilder]: For program point L1618-2(lines 1618 1625) no Hoare annotation was computed. [2022-12-14 12:02:47,035 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-12-14 12:02:47,035 INFO L895 garLoopResultBuilder]: At program point L1618-3(lines 1618 1625) the Hoare annotation is: (let ((.cse20 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse51 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse52 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) (.cse54 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1))) (.cse0 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse57 (= |ULTIMATE.start_goodB2G2_~result~1#1| (+ |ULTIMATE.start_goodB2G2_~data~1#1| 1))) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse50 (<= 0 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse53 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse55 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= ~globalArgc~0 0)) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= (select |#length| 8) 54)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse50 .cse51 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse52 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse53 .cse35 .cse54 .cse36 .cse37 .cse38 .cse55 .cse40 .cse41 .cse56 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse50 .cse51 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse52 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse53 .cse35 .cse54 .cse36 .cse37 .cse38 .cse55 .cse40 .cse41 .cse56 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse50 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse53 .cse35 .cse36 .cse37 .cse38 .cse39 .cse55 .cse40 .cse41 .cse56 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49)))) [2022-12-14 12:02:47,035 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-12-14 12:02:47,035 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1565) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 12:02:47,036 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse34 .cse35 .cse36 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse12) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-12-14 12:02:47,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 12:02:47,036 INFO L895 garLoopResultBuilder]: At program point L1660(line 1660) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 12:02:47,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-12-14 12:02:47,036 INFO L899 garLoopResultBuilder]: For program point L1660-1(line 1660) no Hoare annotation was computed. [2022-12-14 12:02:47,036 INFO L899 garLoopResultBuilder]: For program point L1603(lines 1603 1611) no Hoare annotation was computed. [2022-12-14 12:02:47,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2022-12-14 12:02:47,036 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 12:02:47,036 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-12-14 12:02:47,037 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: false [2022-12-14 12:02:47,037 INFO L895 garLoopResultBuilder]: At program point L1587(line 1587) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse20 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse21 (store ((as const (Array Int Int)) 0) 0 0)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (= ~globalArgc~0 0)) (.cse38 (= (select |#valid| 6) 1)) (.cse39 (= (select |#length| 8) 54)) (.cse40 (= 5 ~globalFive~0)) (.cse41 (= (select |#valid| 10) 1)) (.cse42 (= (select |#valid| 8) 1)) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) .cse21) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse23 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse21 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse34 .cse35 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|) .cse36 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45))) [2022-12-14 12:02:47,037 INFO L899 garLoopResultBuilder]: For program point L1587-1(line 1587) no Hoare annotation was computed. [2022-12-14 12:02:47,037 INFO L899 garLoopResultBuilder]: For program point L1587-2(lines 1587 1600) no Hoare annotation was computed. [2022-12-14 12:02:47,037 INFO L895 garLoopResultBuilder]: At program point L1587-4(lines 1587 1600) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse36 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse37 (= ~globalArgc~0 0)) (.cse38 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (+ |ULTIMATE.start_goodB2G1_~data~0#1| 1)) .cse33 .cse34 .cse35 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse12) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-12-14 12:02:47,037 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-12-14 12:02:47,037 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2022-12-14 12:02:47,038 INFO L895 garLoopResultBuilder]: At program point L1579(line 1579) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (store ((as const (Array Int Int)) 0) 0 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 12:02:47,038 INFO L899 garLoopResultBuilder]: For program point L1579-1(lines 1548 1582) no Hoare annotation was computed. [2022-12-14 12:02:47,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2022-12-14 12:02:47,038 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1510 1513) the Hoare annotation is: true [2022-12-14 12:02:47,038 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-12-14 12:02:47,040 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:02:47,042 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 12:02:47,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 12:02:47 BoogieIcfgContainer [2022-12-14 12:02:47,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 12:02:47,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 12:02:47,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 12:02:47,048 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 12:02:47,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:00:26" (3/4) ... [2022-12-14 12:02:47,051 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 12:02:47,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-14 12:02:47,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-12-14 12:02:47,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-14 12:02:47,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-12-14 12:02:47,059 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-12-14 12:02:47,059 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-14 12:02:47,059 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 12:02:47,060 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 12:02:47,060 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 12:02:47,093 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 12:02:47,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 12:02:47,094 INFO L158 Benchmark]: Toolchain (without parser) took 142057.71ms. Allocated memory was 148.9MB in the beginning and 268.4MB in the end (delta: 119.5MB). Free memory was 114.3MB in the beginning and 204.0MB in the end (delta: -89.7MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-12-14 12:02:47,094 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 148.9MB. Free memory was 123.2MB in the beginning and 123.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:02:47,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 773.12ms. Allocated memory is still 148.9MB. Free memory was 113.8MB in the beginning and 111.4MB in the end (delta: 2.4MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2022-12-14 12:02:47,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.54ms. Allocated memory is still 148.9MB. Free memory was 111.4MB in the beginning and 108.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 12:02:47,094 INFO L158 Benchmark]: Boogie Preprocessor took 18.07ms. Allocated memory is still 148.9MB. Free memory was 108.0MB in the beginning and 106.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 12:02:47,095 INFO L158 Benchmark]: RCFGBuilder took 339.54ms. Allocated memory is still 148.9MB. Free memory was 106.6MB in the beginning and 87.1MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 12:02:47,095 INFO L158 Benchmark]: TraceAbstraction took 140840.21ms. Allocated memory was 148.9MB in the beginning and 268.4MB in the end (delta: 119.5MB). Free memory was 86.3MB in the beginning and 208.2MB in the end (delta: -121.9MB). Peak memory consumption was 144.8MB. Max. memory is 16.1GB. [2022-12-14 12:02:47,095 INFO L158 Benchmark]: Witness Printer took 45.11ms. Allocated memory is still 268.4MB. Free memory was 208.2MB in the beginning and 204.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 12:02:47,096 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.13ms. Allocated memory is still 148.9MB. Free memory was 123.2MB in the beginning and 123.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 773.12ms. Allocated memory is still 148.9MB. Free memory was 113.8MB in the beginning and 111.4MB in the end (delta: 2.4MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.54ms. Allocated memory is still 148.9MB. Free memory was 111.4MB in the beginning and 108.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.07ms. Allocated memory is still 148.9MB. Free memory was 108.0MB in the beginning and 106.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 339.54ms. Allocated memory is still 148.9MB. Free memory was 106.6MB in the beginning and 87.1MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 140840.21ms. Allocated memory was 148.9MB in the beginning and 268.4MB in the end (delta: 119.5MB). Free memory was 86.3MB in the beginning and 208.2MB in the end (delta: -121.9MB). Peak memory consumption was 144.8MB. Max. memory is 16.1GB. * Witness Printer took 45.11ms. Allocated memory is still 268.4MB. Free memory was 208.2MB in the beginning and 204.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1574]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1605]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1645]: 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 5 procedures, 73 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 140.8s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 17.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 4537 SdHoareTripleChecker+Invalid, 16.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3095 mSDsCounter, 403 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9857 IncrementalHoareTripleChecker+Invalid, 10260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 403 mSolverCounterUnsat, 1442 mSDtfsCounter, 9857 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1315 GetRequests, 1013 SyntacticMatches, 20 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 68.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=15, InterpolantAutomatonStates: 272, 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, 18 MinimizatonAttempts, 294 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 181 PreInvPairs, 255 NumberOfFragments, 9848 HoareAnnotationTreeSize, 181 FomulaSimplifications, 31955 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 25 FomulaSimplificationsInter, 95246 FormulaSimplificationTreeSizeReductionInter, 24.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1448 NumberOfCodeBlocks, 1448 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1682 ConstructedInterpolants, 0 QuantifiedInterpolants, 2064 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3056 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 787/816 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: 19.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 236, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 156, TOOLS_POST_TIME: 7.5s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 6.3s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 3.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 396, TOOLS_QUANTIFIERELIM_TIME: 17.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 560, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 1.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 236, DOMAIN_ISBOTTOM_TIME: 0.5s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 96, CALL_SUMMARIZER_CACHE_MISSES: 16, 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: 7587, DAG_COMPRESSION_RETAINED_NODES: 572, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1662]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 12:02:47,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc514f51-1c0d-494d-a0c2-16b06eb7bd92/bin/utaipan-gh47qXpMRh/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