./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 66e3a7f896fa5340787a3c37b6c0ca2547060e04edd72a371311e7e68cf26523 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 01:07:24,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:07:24,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:07:24,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:07:24,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:07:24,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:07:24,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:07:24,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:07:24,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:07:24,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:07:24,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:07:24,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:07:24,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:07:24,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:07:24,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:07:24,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:07:24,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:07:24,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:07:24,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:07:24,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:07:24,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:07:24,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:07:24,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:07:24,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:07:24,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:07:24,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:07:24,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:07:24,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:07:24,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:07:24,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:07:24,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:07:24,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:07:24,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:07:24,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:07:24,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:07:24,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:07:24,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:07:24,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:07:24,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:07:24,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:07:24,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:07:24,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-26 01:07:24,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:07:24,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:07:24,509 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:07:24,509 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:07:24,510 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:07:24,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:07:24,529 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:07:24,529 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:07:24,530 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:07:24,530 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:07:24,530 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:07:24,531 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:07:24,531 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:07:24,531 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:07:24,531 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:07:24,532 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:07:24,532 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:07:24,532 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:07:24,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:07:24,534 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:07:24,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:07:24,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:07:24,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:07:24,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:07:24,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:07:24,535 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 01:07:24,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:07:24,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:07:24,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:07:24,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:07:24,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:07:24,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:07:24,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:07:24,537 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:07:24,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:07:24,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:07:24,538 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:07:24,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:07:24,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:07:24,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:07:24,539 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_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66e3a7f896fa5340787a3c37b6c0ca2547060e04edd72a371311e7e68cf26523 [2022-11-26 01:07:24,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:07:24,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:07:24,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:07:24,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:07:24,881 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:07:24,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_11_good.i [2022-11-26 01:07:28,040 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:07:28,536 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:07:28,536 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_sub_11_good.i [2022-11-26 01:07:28,559 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/data/7b205aba1/1d62390b47fd4299a87c60a2cf006728/FLAG4f1f594a6 [2022-11-26 01:07:28,576 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/data/7b205aba1/1d62390b47fd4299a87c60a2cf006728 [2022-11-26 01:07:28,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:07:28,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:07:28,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:07:28,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:07:28,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:07:28,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:07:28" (1/1) ... [2022-11-26 01:07:28,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bffa3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:28, skipping insertion in model container [2022-11-26 01:07:28,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:07:28" (1/1) ... [2022-11-26 01:07:28,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:07:28,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:07:29,062 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-26 01:07:29,657 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-26 01:07:29,663 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 01:07:29,665 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 01:07:29,667 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 01:07:29,668 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 01:07:29,690 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-26 01:07:29,698 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-26 01:07:29,707 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-26 01:07:29,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:07:29,719 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:07:29,739 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-26 01:07:29,779 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-26 01:07:29,781 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 01:07:29,782 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 01:07:29,784 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 01:07:29,785 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 01:07:29,790 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-26 01:07:29,793 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-26 01:07:29,797 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-26 01:07:29,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:07:29,915 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:07:29,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29 WrapperNode [2022-11-26 01:07:29,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:07:29,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:07:29,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:07:29,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:07:29,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:29,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,002 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2022-11-26 01:07:30,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:07:30,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:07:30,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:07:30,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:07:30,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,069 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:07:30,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:07:30,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:07:30,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:07:30,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (1/1) ... [2022-11-26 01:07:30,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:07:30,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:30,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:07:30,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:07:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-26 01:07:30,189 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-26 01:07:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-26 01:07:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-26 01:07:30,189 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-26 01:07:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-11-26 01:07:30,192 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-11-26 01:07:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:07:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-26 01:07:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:07:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:07:30,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:07:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 01:07:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-11-26 01:07:30,195 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-11-26 01:07:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-26 01:07:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:07:30,369 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:07:30,371 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:07:30,653 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:07:30,695 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:07:30,696 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 01:07:30,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:30 BoogieIcfgContainer [2022-11-26 01:07:30,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:07:30,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:07:30,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:07:30,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:07:30,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:07:28" (1/3) ... [2022-11-26 01:07:30,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f812d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:07:30, skipping insertion in model container [2022-11-26 01:07:30,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:07:29" (2/3) ... [2022-11-26 01:07:30,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f812d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:07:30, skipping insertion in model container [2022-11-26 01:07:30,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:30" (3/3) ... [2022-11-26 01:07:30,709 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_sub_11_good.i [2022-11-26 01:07:30,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:07:30,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-26 01:07:30,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:07:30,794 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;@16ae25be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:07:30,795 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-26 01:07:30,800 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-11-26 01:07:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 01:07:30,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:30,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:30,810 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-11-26 01:07:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash 63524263, now seen corresponding path program 1 times [2022-11-26 01:07:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:30,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918179745] [2022-11-26 01:07:30,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:30,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:31,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:31,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918179745] [2022-11-26 01:07:31,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918179745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:31,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:31,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:07:31,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269998206] [2022-11-26 01:07:31,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:31,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:31,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:31,334 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-11-26 01:07:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:31,443 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-11-26 01:07:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:31,446 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-11-26 01:07:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:31,455 INFO L225 Difference]: With dead ends: 137 [2022-11-26 01:07:31,456 INFO L226 Difference]: Without dead ends: 68 [2022-11-26 01:07:31,459 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-11-26 01:07:31,464 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.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:31,465 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.1s Time] [2022-11-26 01:07:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-26 01:07:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-26 01:07:31,508 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-11-26 01:07:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-11-26 01:07:31,512 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-11-26 01:07:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:31,514 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-11-26 01:07:31,515 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-11-26 01:07:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-11-26 01:07:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 01:07:31,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:31,517 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-11-26 01:07:31,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:07:31,518 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-11-26 01:07:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:31,519 INFO L85 PathProgramCache]: Analyzing trace with hash 182324300, now seen corresponding path program 1 times [2022-11-26 01:07:31,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:31,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634143001] [2022-11-26 01:07:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:31,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:31,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634143001] [2022-11-26 01:07:31,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634143001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:31,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:31,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:31,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410393279] [2022-11-26 01:07:31,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:31,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:31,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:31,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:31,625 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), 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-11-26 01:07:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:31,710 INFO L93 Difference]: Finished difference Result 163 states and 218 transitions. [2022-11-26 01:07:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:31,711 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), 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 19 [2022-11-26 01:07:31,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:31,713 INFO L225 Difference]: With dead ends: 163 [2022-11-26 01:07:31,713 INFO L226 Difference]: Without dead ends: 113 [2022-11-26 01:07:31,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:31,716 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 44 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:31,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-26 01:07:31,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 72. [2022-11-26 01:07:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.380952380952381) internal successors, (58), 55 states have internal predecessors, (58), 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-11-26 01:07:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 96 transitions. [2022-11-26 01:07:31,742 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 96 transitions. Word has length 19 [2022-11-26 01:07:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:31,742 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 96 transitions. [2022-11-26 01:07:31,743 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), 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-11-26 01:07:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2022-11-26 01:07:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 01:07:31,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:31,744 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-11-26 01:07:31,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:07:31,745 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-11-26 01:07:31,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1357086081, now seen corresponding path program 1 times [2022-11-26 01:07:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:31,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189528200] [2022-11-26 01:07:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:31,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:31,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:31,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189528200] [2022-11-26 01:07:31,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189528200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:31,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:31,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775053278] [2022-11-26 01:07:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:31,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:31,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:31,848 INFO L87 Difference]: Start difference. First operand 72 states and 96 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-11-26 01:07:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:31,879 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-11-26 01:07:31,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:31,880 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), 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 20 [2022-11-26 01:07:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:31,881 INFO L225 Difference]: With dead ends: 72 [2022-11-26 01:07:31,881 INFO L226 Difference]: Without dead ends: 71 [2022-11-26 01:07:31,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:31,883 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 40 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:31,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 97 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-26 01:07:31,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-26 01:07:31,895 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-11-26 01:07:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-11-26 01:07:31,896 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 20 [2022-11-26 01:07:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:31,897 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-11-26 01:07:31,897 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), 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-11-26 01:07:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-11-26 01:07:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-26 01:07:31,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:31,899 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-11-26 01:07:31,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:07:31,900 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-11-26 01:07:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash -88191861, now seen corresponding path program 1 times [2022-11-26 01:07:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:31,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358076477] [2022-11-26 01:07:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 01:07:32,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:32,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358076477] [2022-11-26 01:07:32,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358076477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:32,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:32,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:07:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347972963] [2022-11-26 01:07:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:32,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:32,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:32,004 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-11-26 01:07:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:32,066 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2022-11-26 01:07:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:32,067 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-11-26 01:07:32,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:32,068 INFO L225 Difference]: With dead ends: 119 [2022-11-26 01:07:32,068 INFO L226 Difference]: Without dead ends: 70 [2022-11-26 01:07:32,069 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-11-26 01:07:32,071 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-11-26 01:07:32,071 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-11-26 01:07:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-26 01:07:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-26 01:07:32,082 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-11-26 01:07:32,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-11-26 01:07:32,085 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 33 [2022-11-26 01:07:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:32,085 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-11-26 01:07:32,086 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-11-26 01:07:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-11-26 01:07:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 01:07:32,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:32,088 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-11-26 01:07:32,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 01:07:32,088 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-11-26 01:07:32,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash 98416322, now seen corresponding path program 1 times [2022-11-26 01:07:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:32,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294160643] [2022-11-26 01:07:32,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:07:32,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294160643] [2022-11-26 01:07:32,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294160643] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499769570] [2022-11-26 01:07:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:32,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:32,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:07:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:32,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 01:07:32,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 01:07:32,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:32,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499769570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:32,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:32,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-26 01:07:32,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726763665] [2022-11-26 01:07:32,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:32,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:32,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:32,506 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-11-26 01:07:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:32,577 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2022-11-26 01:07:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:32,578 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-11-26 01:07:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:32,580 INFO L225 Difference]: With dead ends: 134 [2022-11-26 01:07:32,580 INFO L226 Difference]: Without dead ends: 101 [2022-11-26 01:07:32,580 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-11-26 01:07:32,581 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:32,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 175 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-26 01:07:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2022-11-26 01:07:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.297872340425532) 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-11-26 01:07:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-11-26 01:07:32,596 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 34 [2022-11-26 01:07:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:32,597 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-26 01:07:32,597 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-11-26 01:07:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-11-26 01:07:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 01:07:32,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:32,599 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-11-26 01:07:32,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 01:07:32,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:32,812 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-11-26 01:07:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1244061203, now seen corresponding path program 1 times [2022-11-26 01:07:32,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:32,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944950368] [2022-11-26 01:07:32,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:32,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:32,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 01:07:32,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:32,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944950368] [2022-11-26 01:07:32,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944950368] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:32,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036836733] [2022-11-26 01:07:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:32,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:32,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:32,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:32,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:07:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:33,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 01:07:33,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 01:07:33,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:33,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036836733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:33,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:33,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-26 01:07:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842681683] [2022-11-26 01:07:33,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:33,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:33,133 INFO L87 Difference]: Start difference. First operand 76 states and 99 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-11-26 01:07:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:33,182 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2022-11-26 01:07:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:33,183 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-11-26 01:07:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:33,189 INFO L225 Difference]: With dead ends: 102 [2022-11-26 01:07:33,189 INFO L226 Difference]: Without dead ends: 101 [2022-11-26 01:07:33,189 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-11-26 01:07:33,190 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:33,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 179 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-26 01:07:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2022-11-26 01:07:33,201 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-11-26 01:07:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2022-11-26 01:07:33,202 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 35 [2022-11-26 01:07:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:33,203 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2022-11-26 01:07:33,203 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-11-26 01:07:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-11-26 01:07:33,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 01:07:33,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:33,205 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-11-26 01:07:33,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:33,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:33,412 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-11-26 01:07:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1341109177, now seen corresponding path program 1 times [2022-11-26 01:07:33,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:33,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355443804] [2022-11-26 01:07:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 01:07:33,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:33,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355443804] [2022-11-26 01:07:33,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355443804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:33,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:33,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616685018] [2022-11-26 01:07:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:33,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:33,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:33,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:33,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:33,489 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), 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-11-26 01:07:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:33,529 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2022-11-26 01:07:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:33,532 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), 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 36 [2022-11-26 01:07:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:33,535 INFO L225 Difference]: With dead ends: 100 [2022-11-26 01:07:33,535 INFO L226 Difference]: Without dead ends: 99 [2022-11-26 01:07:33,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:33,537 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 29 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 160 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-11-26 01:07:33,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 160 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-26 01:07:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-11-26 01:07:33,558 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-11-26 01:07:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-11-26 01:07:33,565 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 36 [2022-11-26 01:07:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:33,566 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-11-26 01:07:33,566 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), 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-11-26 01:07:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-11-26 01:07:33,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-26 01:07:33,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:33,571 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-11-26 01:07:33,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 01:07:33,572 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-11-26 01:07:33,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1375288584, now seen corresponding path program 1 times [2022-11-26 01:07:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:33,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23953343] [2022-11-26 01:07:33,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:33,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 01:07:33,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:33,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23953343] [2022-11-26 01:07:33,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23953343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:33,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:33,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606999424] [2022-11-26 01:07:33,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:33,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:33,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:33,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:33,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:33,685 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), 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-11-26 01:07:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:33,717 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2022-11-26 01:07:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:33,718 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), 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 37 [2022-11-26 01:07:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:33,722 INFO L225 Difference]: With dead ends: 76 [2022-11-26 01:07:33,722 INFO L226 Difference]: Without dead ends: 75 [2022-11-26 01:07:33,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:33,726 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:33,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-26 01:07:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-11-26 01:07:33,747 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-11-26 01:07:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2022-11-26 01:07:33,748 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 37 [2022-11-26 01:07:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:33,748 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2022-11-26 01:07:33,748 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), 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-11-26 01:07:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2022-11-26 01:07:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-26 01:07:33,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:33,750 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-11-26 01:07:33,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 01:07:33,750 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-11-26 01:07:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1961623989, now seen corresponding path program 1 times [2022-11-26 01:07:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:33,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182495142] [2022-11-26 01:07:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:33,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-26 01:07:33,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:33,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182495142] [2022-11-26 01:07:33,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182495142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:33,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445982599] [2022-11-26 01:07:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:33,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:33,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:33,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:33,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:07:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:33,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 01:07:33,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 01:07:34,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:34,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445982599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:34,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:34,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-26 01:07:34,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647169429] [2022-11-26 01:07:34,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:34,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:34,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:34,018 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-11-26 01:07:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:34,042 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2022-11-26 01:07:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:34,043 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-11-26 01:07:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:34,046 INFO L225 Difference]: With dead ends: 73 [2022-11-26 01:07:34,046 INFO L226 Difference]: Without dead ends: 72 [2022-11-26 01:07:34,046 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-11-26 01:07:34,049 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 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-11-26 01:07:34,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:34,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-26 01:07:34,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-26 01:07:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 53 states have internal predecessors, (57), 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-11-26 01:07:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2022-11-26 01:07:34,062 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 44 [2022-11-26 01:07:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:34,062 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2022-11-26 01:07:34,063 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-11-26 01:07:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2022-11-26 01:07:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-26 01:07:34,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:34,065 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-11-26 01:07:34,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-26 01:07:34,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:34,270 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-11-26 01:07:34,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash 680801653, now seen corresponding path program 1 times [2022-11-26 01:07:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:34,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468294051] [2022-11-26 01:07:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:34,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-26 01:07:34,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:34,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468294051] [2022-11-26 01:07:34,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468294051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:34,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397971034] [2022-11-26 01:07:34,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:34,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:34,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:34,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:34,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:07:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:34,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 01:07:34,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 01:07:34,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:34,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397971034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:34,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:34,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-26 01:07:34,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863421847] [2022-11-26 01:07:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:34,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:34,474 INFO L87 Difference]: Start difference. First operand 72 states and 95 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-11-26 01:07:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:34,503 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2022-11-26 01:07:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:34,503 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-11-26 01:07:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:34,504 INFO L225 Difference]: With dead ends: 89 [2022-11-26 01:07:34,504 INFO L226 Difference]: Without dead ends: 88 [2022-11-26 01:07:34,505 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-11-26 01:07:34,505 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:34,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 149 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-26 01:07:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2022-11-26 01:07:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.24) 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-11-26 01:07:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2022-11-26 01:07:34,514 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 45 [2022-11-26 01:07:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:34,514 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-11-26 01:07:34,514 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-11-26 01:07:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2022-11-26 01:07:34,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-26 01:07:34,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:34,515 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, 1] [2022-11-26 01:07:34,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:34,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 01:07:34,721 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 01:07:34,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:34,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1699985791, now seen corresponding path program 1 times [2022-11-26 01:07:34,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:34,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262410550] [2022-11-26 01:07:34,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:34,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-26 01:07:34,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:34,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262410550] [2022-11-26 01:07:34,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262410550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:34,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001516779] [2022-11-26 01:07:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:34,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:34,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:34,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:34,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:07:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:34,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 01:07:34,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-26 01:07:34,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:34,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001516779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:34,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:34,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-26 01:07:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410895288] [2022-11-26 01:07:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:34,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:34,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:34,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:34,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:07:34,985 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, (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-11-26 01:07:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:35,006 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-11-26 01:07:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:35,006 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, (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 48 [2022-11-26 01:07:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:35,007 INFO L225 Difference]: With dead ends: 77 [2022-11-26 01:07:35,007 INFO L226 Difference]: Without dead ends: 76 [2022-11-26 01:07:35,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-11-26 01:07:35,008 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 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-11-26 01:07:35,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:07:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-26 01:07:35,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2022-11-26 01:07:35,016 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-11-26 01:07:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-11-26 01:07:35,018 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 48 [2022-11-26 01:07:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:35,019 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-11-26 01:07:35,019 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, (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-11-26 01:07:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-11-26 01:07:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-26 01:07:35,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:35,021 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-11-26 01:07:35,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:35,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:35,228 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-11-26 01:07:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1213882814, now seen corresponding path program 1 times [2022-11-26 01:07:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:35,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708521622] [2022-11-26 01:07:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-26 01:07:35,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708521622] [2022-11-26 01:07:35,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708521622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:35,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436387932] [2022-11-26 01:07:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:35,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:35,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:35,328 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:35,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:07:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:35,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:07:35,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-26 01:07:35,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:35,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436387932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:35,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:35,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-26 01:07:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386972856] [2022-11-26 01:07:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:35,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:35,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:35,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:35,488 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-11-26 01:07:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:35,527 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-11-26 01:07:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:35,528 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-11-26 01:07:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:35,528 INFO L225 Difference]: With dead ends: 107 [2022-11-26 01:07:35,528 INFO L226 Difference]: Without dead ends: 71 [2022-11-26 01:07:35,529 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-11-26 01:07:35,529 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-11-26 01:07:35,530 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-11-26 01:07:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-26 01:07:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-26 01:07:35,536 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-11-26 01:07:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-11-26 01:07:35,537 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 54 [2022-11-26 01:07:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:35,537 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-11-26 01:07:35,537 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-11-26 01:07:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-11-26 01:07:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-26 01:07:35,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:35,538 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-11-26 01:07:35,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:35,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 01:07:35,744 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-11-26 01:07:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2011693763, now seen corresponding path program 1 times [2022-11-26 01:07:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:35,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181583348] [2022-11-26 01:07:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-26 01:07:35,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:35,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181583348] [2022-11-26 01:07:35,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181583348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719114153] [2022-11-26 01:07:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:35,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:35,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:35,831 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:35,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 01:07:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:35,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:07:35,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 01:07:35,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:35,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719114153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:35,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:35,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-26 01:07:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209741742] [2022-11-26 01:07:35,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:35,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:35,998 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-11-26 01:07:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:36,040 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-11-26 01:07:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:36,041 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-11-26 01:07:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:36,043 INFO L225 Difference]: With dead ends: 100 [2022-11-26 01:07:36,043 INFO L226 Difference]: Without dead ends: 71 [2022-11-26 01:07:36,043 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-11-26 01:07:36,044 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-11-26 01:07:36,045 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-11-26 01:07:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-26 01:07:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-26 01:07:36,054 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-11-26 01:07:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2022-11-26 01:07:36,055 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 56 [2022-11-26 01:07:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:36,056 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2022-11-26 01:07:36,057 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-11-26 01:07:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-11-26 01:07:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-26 01:07:36,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:36,058 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-11-26 01:07:36,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:36,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 01:07:36,265 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-11-26 01:07:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -227559506, now seen corresponding path program 1 times [2022-11-26 01:07:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:36,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292711222] [2022-11-26 01:07:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:07:36,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:36,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292711222] [2022-11-26 01:07:36,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292711222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:36,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125604613] [2022-11-26 01:07:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:36,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:36,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:36,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:36,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 01:07:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:36,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 01:07:36,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-26 01:07:36,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:36,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125604613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:36,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:36,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-26 01:07:36,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150956039] [2022-11-26 01:07:36,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:36,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:36,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:36,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:07:36,525 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-11-26 01:07:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:36,566 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2022-11-26 01:07:36,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:36,567 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-11-26 01:07:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:36,568 INFO L225 Difference]: With dead ends: 83 [2022-11-26 01:07:36,568 INFO L226 Difference]: Without dead ends: 71 [2022-11-26 01:07:36,568 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-11-26 01:07:36,569 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-11-26 01:07:36,569 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-11-26 01:07:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-26 01:07:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-26 01:07:36,578 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-11-26 01:07:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-11-26 01:07:36,580 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 60 [2022-11-26 01:07:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:36,580 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-11-26 01:07:36,581 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-11-26 01:07:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-11-26 01:07:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-26 01:07:36,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:36,583 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-11-26 01:07:36,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:36,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:36,789 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-11-26 01:07:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash 639997850, now seen corresponding path program 1 times [2022-11-26 01:07:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:36,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280704213] [2022-11-26 01:07:36,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:07:36,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:36,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280704213] [2022-11-26 01:07:36,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280704213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:36,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629020738] [2022-11-26 01:07:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:36,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:36,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 01:07:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:37,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:07:37,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:07:37,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:07:37,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629020738] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:37,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [709832981] [2022-11-26 01:07:37,250 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-11-26 01:07:37,250 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:37,255 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:37,262 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:37,263 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:37,716 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-11-26 01:07:37,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:37,759 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-26 01:07:37,759 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-11-26 01:07:37,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:37,958 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-26 01:07:37,958 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-11-26 01:07:38,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:38,238 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-26 01:07:38,239 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-11-26 01:07:38,286 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-11-26 01:07:38,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:38,431 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-11-26 01:07:39,598 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-11-26 01:07:39,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:39,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:39,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:39,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:39,671 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-26 01:07:39,672 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-11-26 01:07:39,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:39,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:39,965 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-26 01:07:39,966 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-11-26 01:07:40,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:40,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:40,025 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:07:40,026 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-11-26 01:07:40,096 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-11-26 01:07:40,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:40,251 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-11-26 01:07:43,394 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-26 01:07:43,398 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-11-26 01:07:43,447 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-26 01:07:43,618 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-11-26 01:07:43,622 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:56,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [709832981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:56,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:56,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-11-26 01:07:56,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678164248] [2022-11-26 01:07:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:56,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-26 01:07:56,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:56,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-26 01:07:56,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2022-11-26 01:07:56,069 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-11-26 01:08:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:06,822 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2022-11-26 01:08:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-26 01:08:06,823 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-11-26 01:08:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:06,824 INFO L225 Difference]: With dead ends: 200 [2022-11-26 01:08:06,825 INFO L226 Difference]: Without dead ends: 156 [2022-11-26 01:08:06,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=294, Invalid=1962, Unknown=0, NotChecked=0, Total=2256 [2022-11-26 01:08:06,829 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 108 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 2562 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:06,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 821 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2562 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-11-26 01:08:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-26 01:08:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 110. [2022-11-26 01:08:06,872 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-11-26 01:08:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2022-11-26 01:08:06,873 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 65 [2022-11-26 01:08:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:06,874 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2022-11-26 01:08:06,874 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-11-26 01:08:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2022-11-26 01:08:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-26 01:08:06,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:06,876 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-11-26 01:08:06,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:07,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:07,082 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-11-26 01:08:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1438476175, now seen corresponding path program 1 times [2022-11-26 01:08:07,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:07,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698534376] [2022-11-26 01:08:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:07,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-26 01:08:07,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698534376] [2022-11-26 01:08:07,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698534376] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565193285] [2022-11-26 01:08:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:07,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:07,215 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:07,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 01:08:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:07,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:08:07,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-26 01:08:07,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-26 01:08:07,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565193285] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:07,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1307748886] [2022-11-26 01:08:07,539 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-26 01:08:07,539 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:08:07,540 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:08:07,540 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:08:07,540 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:08:07,796 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-11-26 01:08:07,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:08,008 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-26 01:08:08,009 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-11-26 01:08:08,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:08,045 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-11-26 01:08:08,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:08,070 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-11-26 01:08:08,111 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-11-26 01:08:08,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:08,190 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-11-26 01:08:09,152 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-11-26 01:08:09,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,206 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-26 01:08:09,207 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-11-26 01:08:09,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,300 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:08:09,300 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-11-26 01:08:09,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,383 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-26 01:08:09,383 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-11-26 01:08:09,452 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-11-26 01:08:09,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:09,694 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-11-26 01:08:09,694 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-11-26 01:08:22,833 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-26 01:08:22,835 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-26 01:08:22,837 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-11-26 01:08:22,840 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-26 01:08:22,946 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:08:48,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1307748886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:48,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:48,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 41 [2022-11-26 01:08:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224066497] [2022-11-26 01:08:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:48,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-26 01:08:48,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:48,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-26 01:08:48,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1477, Unknown=0, NotChecked=0, Total=1722 [2022-11-26 01:08:48,345 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-11-26 01:09:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:00,229 INFO L93 Difference]: Finished difference Result 177 states and 215 transitions. [2022-11-26 01:09:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-26 01:09:00,230 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-11-26 01:09:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:00,231 INFO L225 Difference]: With dead ends: 177 [2022-11-26 01:09:00,231 INFO L226 Difference]: Without dead ends: 91 [2022-11-26 01:09:00,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 151 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=426, Invalid=2544, Unknown=0, NotChecked=0, Total=2970 [2022-11-26 01:09:00,233 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 84 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:00,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 287 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-26 01:09:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-26 01:09:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2022-11-26 01:09:00,258 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-11-26 01:09:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2022-11-26 01:09:00,259 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 67 [2022-11-26 01:09:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:00,259 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2022-11-26 01:09:00,259 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-11-26 01:09:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2022-11-26 01:09:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-26 01:09:00,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:00,261 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-11-26 01:09:00,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 01:09:00,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-26 01:09:00,468 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-11-26 01:09:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 149433891, now seen corresponding path program 1 times [2022-11-26 01:09:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:00,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510290543] [2022-11-26 01:09:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-26 01:09:00,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510290543] [2022-11-26 01:09:00,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510290543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781372313] [2022-11-26 01:09:00,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:00,594 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:00,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 01:09:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:00,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:09:00,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:09:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-26 01:09:00,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:09:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-26 01:09:00,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781372313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:09:00,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1000952945] [2022-11-26 01:09:00,892 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-26 01:09:00,892 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:09:00,894 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:09:00,894 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:09:00,894 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:09:01,150 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-11-26 01:09:01,160 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-11-26 01:09:01,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:01,206 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-11-26 01:09:01,207 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-11-26 01:09:01,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:01,409 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-11-26 01:09:01,410 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-11-26 01:09:01,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:01,670 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-26 01:09:01,671 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-11-26 01:09:01,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:01,776 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-11-26 01:09:02,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:02,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:02,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:02,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:02,742 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-26 01:09:02,743 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-11-26 01:09:02,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:02,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:03,024 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-26 01:09:03,025 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-11-26 01:09:03,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:03,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:03,088 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:09:03,088 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-11-26 01:09:03,159 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-11-26 01:09:03,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-11-26 01:09:03,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:03,311 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-11-26 01:09:06,182 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-26 01:09:06,184 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 205 for LOIs [2022-11-26 01:09:06,351 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-26 01:09:06,475 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-11-26 01:09:06,623 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:09:27,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1000952945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:09:27,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:09:27,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 42 [2022-11-26 01:09:27,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679304837] [2022-11-26 01:09:27,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:09:27,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-26 01:09:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-26 01:09:27,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1536, Unknown=0, NotChecked=0, Total=1806 [2022-11-26 01:09:27,235 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-11-26 01:09:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:51,362 INFO L93 Difference]: Finished difference Result 239 states and 291 transitions. [2022-11-26 01:09:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-11-26 01:09:51,366 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-11-26 01:09:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:51,367 INFO L225 Difference]: With dead ends: 239 [2022-11-26 01:09:51,367 INFO L226 Difference]: Without dead ends: 174 [2022-11-26 01:09:51,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=613, Invalid=3809, Unknown=0, NotChecked=0, Total=4422 [2022-11-26 01:09:51,370 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 160 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:51,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 785 Invalid, 2771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-11-26 01:09:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-26 01:09:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 73. [2022-11-26 01:09:51,413 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-11-26 01:09:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-26 01:09:51,414 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 67 [2022-11-26 01:09:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:51,414 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-26 01:09:51,414 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-11-26 01:09:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-26 01:09:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-26 01:09:51,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:51,416 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-11-26 01:09:51,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 01:09:51,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-26 01:09:51,623 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-11-26 01:09:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash -424038214, now seen corresponding path program 1 times [2022-11-26 01:09:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:51,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496363356] [2022-11-26 01:09:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:09:51,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:51,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496363356] [2022-11-26 01:09:51,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496363356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:51,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330735680] [2022-11-26 01:09:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:51,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:51,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:51,815 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:51,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 01:09:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:51,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:09:51,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:09:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:09:52,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:09:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-26 01:09:52,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330735680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:09:52,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1105159439] [2022-11-26 01:09:52,119 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-26 01:09:52,120 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:09:52,120 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:09:52,120 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:09:52,120 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:09:52,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:52,618 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-11-26 01:09:52,619 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-11-26 01:09:52,648 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-11-26 01:09:52,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:52,667 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-11-26 01:09:52,683 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-11-26 01:09:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:52,700 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-11-26 01:09:52,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:52,799 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-11-26 01:09:53,790 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-11-26 01:09:53,802 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-11-26 01:09:53,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:53,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:53,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:53,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:53,866 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-11-26 01:09:53,866 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-11-26 01:09:53,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:53,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:54,203 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-11-26 01:09:54,203 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-11-26 01:09:54,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:54,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:54,268 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 01:09:54,269 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-11-26 01:09:54,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:54,460 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-11-26 01:09:57,680 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-11-26 01:09:57,683 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-26 01:09:57,686 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-11-26 01:09:57,817 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-11-26 01:09:57,828 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:16,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1105159439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:16,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:10:16,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 43 [2022-11-26 01:10:16,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645464849] [2022-11-26 01:10:16,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:16,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-26 01:10:16,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:16,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-26 01:10:16,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2022-11-26 01:10:16,159 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-11-26 01:10:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:47,761 INFO L93 Difference]: Finished difference Result 183 states and 224 transitions. [2022-11-26 01:10:47,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-11-26 01:10:47,762 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-11-26 01:10:47,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:47,762 INFO L225 Difference]: With dead ends: 183 [2022-11-26 01:10:47,762 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 01:10:47,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 161 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=1151, Invalid=6681, Unknown=0, NotChecked=0, Total=7832 [2022-11-26 01:10:47,764 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:47,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 238 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-26 01:10:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 01:10:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 01:10:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 01:10:47,766 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-11-26 01:10:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:47,767 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 01:10:47,767 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-11-26 01:10:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 01:10:47,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 01:10:47,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-26 01:10:47,771 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-26 01:10:47,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-26 01:10:47,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-26 01:10:47,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-26 01:10:47,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-26 01:10:47,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-26 01:10:47,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-26 01:10:47,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:47,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 01:10:47,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 01:11:08,003 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 397 DAG size of output: 249 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 01:11:14,807 WARN L233 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 396 DAG size of output: 248 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 01:11:20,468 WARN L233 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 394 DAG size of output: 246 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 01:11:25,858 WARN L233 SmtUtils]: Spent 5.38s on a formula simplification. DAG size of input: 389 DAG size of output: 241 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 01:11:34,844 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-26 01:11:34,845 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-26 01:11:34,845 INFO L902 garLoopResultBuilder]: At program point globalReturnsFalseENTRY(lines 1514 1517) the Hoare annotation is: true [2022-11-26 01:11:34,845 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-11-26 01:11:34,845 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-26 01:11:34,845 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-26 01:11:34,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2022-11-26 01:11:34,846 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-26 01:11:34,846 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-26 01:11:34,846 INFO L902 garLoopResultBuilder]: At program point L1662-1(line 1662) the Hoare annotation is: true [2022-11-26 01:11:34,846 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-26 01:11:34,846 INFO L902 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: true [2022-11-26 01:11:34,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2022-11-26 01:11:34,847 INFO L895 garLoopResultBuilder]: At program point L1638(line 1638) the Hoare annotation is: (let ((.cse44 (store ((as const (Array Int Int)) 0) 0 0)) (.cse58 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648)) (.cse59 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (let ((.cse38 (<= 0 .cse59)) (.cse45 (<= .cse59 0)) (.cse53 (<= .cse58 0)) (.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)) (.cse54 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#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)) (.cse55 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse44 (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))))) (.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|)) (.cse56 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse57 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select |#length| 8) 48)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= 48 (select |#length| 5))) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse43 (<= 0 .cse58)) (.cse46 (= (select |#valid| 6) 1)) (.cse47 (= 5 ~globalFive~0)) (.cse48 (= (select |#valid| 10) 1)) (.cse49 (= (select |#valid| 8) 1)) (.cse50 (< 0 |#StackHeapBarrier|)) (.cse51 (= |#NULL.base| 0)) (.cse52 (= ~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 (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|) .cse44) (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 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse53 .cse15 .cse16 .cse17 .cse18 (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|) .cse44) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse54 .cse8 .cse9 .cse10 .cse11 .cse55 .cse12 .cse13 .cse14 .cse53 .cse15 .cse16 .cse17 .cse18 .cse56 .cse19 .cse20 .cse57 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse41 .cse43 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse54 .cse8 .cse9 .cse10 .cse11 .cse55 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse56 .cse19 .cse20 .cse57 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52)))) [2022-11-26 01:11:34,848 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2022-11-26 01:11:34,848 INFO L899 garLoopResultBuilder]: For program point L1638-1(line 1638) no Hoare annotation was computed. [2022-11-26 01:11:34,848 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1580) no Hoare annotation was computed. [2022-11-26 01:11:34,848 INFO L899 garLoopResultBuilder]: For program point L1605-1(line 1605) no Hoare annotation was computed. [2022-11-26 01:11:34,849 INFO L895 garLoopResultBuilder]: At program point L1638-4(lines 1638 1641) the Hoare annotation is: (let ((.cse21 (store ((as const (Array Int Int)) 0) 0 0)) (.cse59 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (.cse58 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (let ((.cse15 (<= .cse58 0)) (.cse40 (<= 0 .cse59)) (.cse44 (<= .cse59 0)) (.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)) (.cse52 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#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)) (.cse53 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse21 (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))))) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (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_goodG2B2_~data~3#1| 2) 0)) (.cse54 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse55 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select |#length| 8) 48)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= 48 (select |#length| 5))) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse41 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse56 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse57 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse43 (<= 0 .cse58)) (.cse45 (= (select |#valid| 6) 1)) (.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 (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|) .cse21) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .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 .cse52 .cse8 .cse9 .cse10 .cse11 .cse53 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse54 .cse22 .cse55 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse56 .cse42 .cse57 .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|) .cse21) (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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse52 .cse8 .cse9 .cse10 .cse11 .cse53 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse54 .cse22 .cse55 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse56 .cse42 .cse57 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-11-26 01:11:34,849 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-26 01:11:34,850 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: (let ((.cse57 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (.cse52 (store ((as const (Array Int Int)) 0) 0 0)) (.cse58 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (let ((.cse17 (<= .cse58 0)) (.cse8 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse13 (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_~data~0#1| 2147483647)) (.cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~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)) (.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|)) (.cse23 (= 16 (select |#length| 7))) (.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 |#length| 8) 48)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= 48 (select |#length| 5))) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse53 (<= 0 .cse57)) (.cse42 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse55 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse56 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse44 (<= 0 .cse58)) (.cse54 (<= .cse57 0)) (.cse45 (= (select |#valid| 6) 1)) (.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 .cse9 .cse10 .cse11 .cse12 .cse14 .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)))) .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse53 .cse42 .cse43 .cse44 .cse54 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .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 .cse55 .cse43 .cse56 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse53 .cse42 .cse55 .cse43 .cse56 .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|) .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)))) .cse54 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-11-26 01:11:34,850 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 01:11:34,850 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 |#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 |#length| 8) 48)) (.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 (= 48 (select |#length| 5))) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.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 .cse5 .cse6 .cse7 .cse8 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse23 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (let ((.cse49 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (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 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 .cse49) .cse41 (<= .cse49 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48)))) [2022-11-26 01:11:34,850 INFO L899 garLoopResultBuilder]: For program point L1597-1(lines 1591 1598) no Hoare annotation was computed. [2022-11-26 01:11:34,850 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-11-26 01:11:34,850 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1633) no Hoare annotation was computed. [2022-11-26 01:11:34,851 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 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse41 (store ((as const (Array Int Int)) 0) 0 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 (< 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select |#length| 8) 48)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= 48 (select |#length| 5))) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse42 (= (select |#valid| 6) 1)) (.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 (let ((.cse37 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (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 (<= 0 .cse37) .cse38 .cse39 .cse40 (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|) .cse41) (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)))) (<= .cse37 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse41 (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)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-11-26 01:11:34,851 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1574) no Hoare annotation was computed. [2022-11-26 01:11:34,851 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-11-26 01:11:34,851 INFO L899 garLoopResultBuilder]: For program point L1574-1(line 1574) no Hoare annotation was computed. [2022-11-26 01:11:34,851 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-26 01:11:34,851 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1581) no Hoare annotation was computed. [2022-11-26 01:11:34,852 INFO L899 garLoopResultBuilder]: For program point L1591(lines 1591 1598) no Hoare annotation was computed. [2022-11-26 01:11:34,852 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1613) no Hoare annotation was computed. [2022-11-26 01:11:34,852 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) (< 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~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)))) (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) (= (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 |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-26 01:11:34,853 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2022-11-26 01:11:34,853 INFO L899 garLoopResultBuilder]: For program point L1642-1(lines 1642 1648) no Hoare annotation was computed. [2022-11-26 01:11:34,853 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1649) no Hoare annotation was computed. [2022-11-26 01:11:34,853 INFO L899 garLoopResultBuilder]: For program point L1601(line 1601) no Hoare annotation was computed. [2022-11-26 01:11:34,853 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-26 01:11:34,853 INFO L899 garLoopResultBuilder]: For program point L1601-1(lines 1601 1612) no Hoare annotation was computed. [2022-11-26 01:11:34,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-26 01:11:34,853 INFO L899 garLoopResultBuilder]: For program point L1626(line 1626) no Hoare annotation was computed. [2022-11-26 01:11:34,854 INFO L899 garLoopResultBuilder]: For program point L1626-1(lines 1626 1632) no Hoare annotation was computed. [2022-11-26 01:11:34,854 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (let ((.cse56 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (.cse57 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648)) (.cse53 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse9 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse14 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse53 (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_~data~0#1| 2147483647)) (.cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse55 (<= .cse57 0)) (.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|)) (.cse23 (= 16 (select |#length| 7))) (.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 |#length| 8) 48)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= 48 (select |#length| 5))) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse52 (<= 0 .cse56)) (.cse42 (= ~globalArgc~0 0)) (.cse44 (<= 0 .cse57)) (.cse54 (<= .cse56 0)) (.cse45 (= (select |#valid| 6) 1)) (.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 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse52 .cse41 .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|) .cse53) (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)))) .cse54 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse55 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse55 .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|) .cse53) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse52 .cse42 .cse44 .cse54 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-11-26 01:11:34,855 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-26 01:11:34,855 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 |#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 |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-26 01:11:34,855 INFO L899 garLoopResultBuilder]: For program point L1618-2(lines 1618 1625) no Hoare annotation was computed. [2022-11-26 01:11:34,855 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-26 01:11:34,856 INFO L895 garLoopResultBuilder]: At program point L1618-3(lines 1618 1625) the Hoare annotation is: (let ((.cse56 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648)) (.cse53 (store ((as const (Array Int Int)) 0) 0 0)) (.cse57 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (let ((.cse54 (<= 0 .cse57)) (.cse43 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse55 (<= .cse57 0)) (.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 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse53 (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)) (.cse52 (<= .cse56 0)) (.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_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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 |#length| 8) 48)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= 48 (select |#length| 5))) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse44 (<= 0 .cse56)) (.cse45 (= (select |#valid| 6) 1)) (.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 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse52 .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|) .cse53) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse54 .cse42 .cse44 .cse55 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse54 .cse41 .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|) .cse53) (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)))) .cse55 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse52 .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 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-11-26 01:11:34,856 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-11-26 01:11:34,857 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 |#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 |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-26 01:11:34,857 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: (let ((.cse48 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (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)) (.cse20 (store ((as const (Array Int Int)) 0) 0 0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (<= .cse48 0)) (.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 (= 16 (select |#length| 7))) (.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 |#length| 8) 48)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= 48 (select |#length| 5))) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 .cse48)) (.cse41 (= (select |#valid| 6) 1)) (.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 (let ((.cse38 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (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 (<= 0 .cse38) .cse39 .cse40 (<= .cse38 0) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse8 .cse9 .cse10 .cse11 (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)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse21 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47)))) [2022-11-26 01:11:34,857 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 01:11:34,858 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 |#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 |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-26 01:11:34,858 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-26 01:11:34,858 INFO L899 garLoopResultBuilder]: For program point L1660-1(line 1660) no Hoare annotation was computed. [2022-11-26 01:11:34,858 INFO L899 garLoopResultBuilder]: For program point L1603(lines 1603 1611) no Hoare annotation was computed. [2022-11-26 01:11:34,858 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1605) no Hoare annotation was computed. [2022-11-26 01:11:34,859 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 |#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 |#length| 8) 48) (= (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) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 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-11-26 01:11:34,859 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-11-26 01:11:34,859 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: false [2022-11-26 01:11:34,860 INFO L895 garLoopResultBuilder]: At program point L1587(line 1587) the Hoare annotation is: (let ((.cse46 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (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)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~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 (= 16 (select |#length| 7))) (.cse9 (store ((as const (Array Int Int)) 0) 0 0)) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select |#length| 8) 48)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= 48 (select |#length| 5))) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (<= 0 .cse46)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.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 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 6)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 5)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 4)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 3)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|) .cse9))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 0 |ULTIMATE.start_goodB2G2_~data~1#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .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|) .cse9) (< |#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)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (<= .cse46 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45)))) [2022-11-26 01:11:34,860 INFO L899 garLoopResultBuilder]: For program point L1587-1(line 1587) no Hoare annotation was computed. [2022-11-26 01:11:34,860 INFO L899 garLoopResultBuilder]: For program point L1587-2(lines 1587 1600) no Hoare annotation was computed. [2022-11-26 01:11:34,860 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)) (.cse19 (store ((as const (Array Int Int)) 0) 0 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|)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select |#length| 8) 48)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= 48 (select |#length| 5))) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse41 (= (select |#valid| 6) 1)) (.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 (let ((.cse37 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (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|) .cse19) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 0 .cse37) .cse38 .cse39 .cse40 (<= .cse37 0) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse19 (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)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-11-26 01:11:34,861 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-26 01:11:34,861 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2022-11-26 01:11:34,861 INFO L895 garLoopResultBuilder]: At program point L1579(line 1579) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (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)) (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 |#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 |#length| 8) 48) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 48 (select |#length| 5)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 .cse0) (= ~globalArgc~0 0) (<= .cse0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-11-26 01:11:34,861 INFO L899 garLoopResultBuilder]: For program point L1579-1(lines 1566 1581) no Hoare annotation was computed. [2022-11-26 01:11:34,862 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1645) no Hoare annotation was computed. [2022-11-26 01:11:34,862 INFO L902 garLoopResultBuilder]: At program point globalReturnsTrueENTRY(lines 1510 1513) the Hoare annotation is: true [2022-11-26 01:11:34,862 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-11-26 01:11:34,865 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-11-26 01:11:34,868 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 01:11:34,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:11:34 BoogieIcfgContainer [2022-11-26 01:11:34,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 01:11:34,880 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 01:11:34,880 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 01:11:34,880 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 01:11:34,881 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:07:30" (3/4) ... [2022-11-26 01:11:34,885 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 01:11:34,892 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-26 01:11:34,892 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-11-26 01:11:34,892 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-26 01:11:34,893 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-11-26 01:11:34,910 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-26 01:11:34,911 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-26 01:11:34,911 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-26 01:11:34,912 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 01:11:34,912 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 01:11:34,987 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 01:11:34,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 01:11:34,988 INFO L158 Benchmark]: Toolchain (without parser) took 246407.19ms. Allocated memory was 172.0MB in the beginning and 578.8MB in the end (delta: 406.8MB). Free memory was 132.9MB in the beginning and 374.2MB in the end (delta: -241.3MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. [2022-11-26 01:11:34,988 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 172.0MB. Free memory was 139.5MB in the beginning and 139.4MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:11:34,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1333.65ms. Allocated memory is still 172.0MB. Free memory was 132.9MB in the beginning and 70.9MB in the end (delta: 62.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-11-26 01:11:34,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.91ms. Allocated memory is still 172.0MB. Free memory was 70.9MB in the beginning and 67.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:11:34,990 INFO L158 Benchmark]: Boogie Preprocessor took 87.00ms. Allocated memory is still 172.0MB. Free memory was 67.7MB in the beginning and 138.1MB in the end (delta: -70.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-11-26 01:11:34,990 INFO L158 Benchmark]: RCFGBuilder took 608.38ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 138.1MB in the beginning and 181.1MB in the end (delta: -43.1MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-11-26 01:11:34,991 INFO L158 Benchmark]: TraceAbstraction took 244177.51ms. Allocated memory was 230.7MB in the beginning and 578.8MB in the end (delta: 348.1MB). Free memory was 181.1MB in the beginning and 378.4MB in the end (delta: -197.2MB). Peak memory consumption was 338.0MB. Max. memory is 16.1GB. [2022-11-26 01:11:34,991 INFO L158 Benchmark]: Witness Printer took 107.46ms. Allocated memory is still 578.8MB. Free memory was 378.4MB in the beginning and 374.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 01:11:35,001 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.39ms. Allocated memory is still 172.0MB. Free memory was 139.5MB in the beginning and 139.4MB in the end (delta: 88.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1333.65ms. Allocated memory is still 172.0MB. Free memory was 132.9MB in the beginning and 70.9MB in the end (delta: 62.0MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.91ms. Allocated memory is still 172.0MB. Free memory was 70.9MB in the beginning and 67.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.00ms. Allocated memory is still 172.0MB. Free memory was 67.7MB in the beginning and 138.1MB in the end (delta: -70.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * RCFGBuilder took 608.38ms. Allocated memory was 172.0MB in the beginning and 230.7MB in the end (delta: 58.7MB). Free memory was 138.1MB in the beginning and 181.1MB in the end (delta: -43.1MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 244177.51ms. Allocated memory was 230.7MB in the beginning and 578.8MB in the end (delta: 348.1MB). Free memory was 181.1MB in the beginning and 378.4MB in the end (delta: -197.2MB). Peak memory consumption was 338.0MB. Max. memory is 16.1GB. * Witness Printer took 107.46ms. Allocated memory is still 578.8MB. Free memory was 378.4MB in the beginning and 374.2MB 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: 244.1s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 79.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 29.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 4522 SdHoareTripleChecker+Invalid, 28.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3070 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9565 IncrementalHoareTripleChecker+Invalid, 9998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 1452 mSDtfsCounter, 9565 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1316 GetRequests, 1006 SyntacticMatches, 24 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4610 ImplicationChecksByTransitivity, 125.6s 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 294 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 181 PreInvPairs, 255 NumberOfFragments, 9957 HoareAnnotationTreeSize, 181 FomulaSimplifications, 15247 FormulaSimplificationTreeSizeReduction, 4.8s HoareSimplificationTime, 25 FomulaSimplificationsInter, 92220 FormulaSimplificationTreeSizeReductionInter, 42.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1450 NumberOfCodeBlocks, 1450 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1684 ConstructedInterpolants, 0 QuantifiedInterpolants, 2132 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3057 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: 33.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 236, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 156, TOOLS_POST_TIME: 12.9s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 10.6s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 5.7s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 396, TOOLS_QUANTIFIERELIM_TIME: 29.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 560, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 2.9s, 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.8s, 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: 7703, 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-11-26 01:11:35,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc7de43-f8b6-46e4-8ffb-ccecee75beff/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE