./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c7c9d2c9047748ba44af6e8c9cafe6abdf2e0bb4dae784264c77826bf449c137 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 05:24:48,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:24:48,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:24:48,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:24:48,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:24:48,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:24:48,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:24:48,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:24:48,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:24:48,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:24:48,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:24:48,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:24:48,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:24:48,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:24:48,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:24:48,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:24:48,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:24:48,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:24:48,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:24:48,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:24:48,251 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:24:48,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:24:48,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:24:48,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:24:48,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:24:48,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:24:48,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:24:48,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:24:48,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:24:48,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:24:48,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:24:48,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:24:48,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:24:48,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:24:48,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:24:48,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:24:48,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:24:48,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:24:48,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:24:48,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:24:48,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:24:48,263 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 05:24:48,278 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:24:48,278 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:24:48,278 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:24:48,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:24:48,279 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:24:48,279 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:24:48,279 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:24:48,279 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:24:48,279 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:24:48,280 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:24:48,280 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:24:48,280 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:24:48,280 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:24:48,280 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:24:48,280 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:24:48,281 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:24:48,281 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:24:48,281 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:24:48,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:24:48,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 05:24:48,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:24:48,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:24:48,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:24:48,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:24:48,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:24:48,283 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 05:24:48,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:24:48,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:24:48,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:24:48,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:24:48,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:24:48,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:24:48,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:24:48,284 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:24:48,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:24:48,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:24:48,284 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:24:48,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:24:48,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:24:48,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:24:48,285 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_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7c9d2c9047748ba44af6e8c9cafe6abdf2e0bb4dae784264c77826bf449c137 [2022-12-14 05:24:48,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:24:48,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:24:48,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:24:48,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:24:48,488 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:24:48,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_08_good.i [2022-12-14 05:24:51,057 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:24:51,291 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:24:51,291 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_preinc_08_good.i [2022-12-14 05:24:51,303 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/data/d9aabb58c/e890a7e17e1243ccbeb2097c14f4787f/FLAG08c62448c [2022-12-14 05:24:51,634 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/data/d9aabb58c/e890a7e17e1243ccbeb2097c14f4787f [2022-12-14 05:24:51,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:24:51,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:24:51,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:24:51,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:24:51,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:24:51,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:24:51" (1/1) ... [2022-12-14 05:24:51,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f4deaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:51, skipping insertion in model container [2022-12-14 05:24:51,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:24:51" (1/1) ... [2022-12-14 05:24:51,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:24:51,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:24:51,945 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 05:24:52,276 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 05:24:52,281 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 05:24:52,283 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 05:24:52,285 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 05:24:52,286 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 05:24:52,309 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 05:24:52,316 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 05:24:52,326 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 05:24:52,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:24:52,338 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:24:52,356 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 05:24:52,399 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 05:24:52,400 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 05:24:52,401 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 05:24:52,404 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 05:24:52,404 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 05:24:52,409 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 05:24:52,411 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 05:24:52,415 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 05:24:52,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:24:52,508 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:24:52,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52 WrapperNode [2022-12-14 05:24:52,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:24:52,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:24:52,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:24:52,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:24:52,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,548 INFO L138 Inliner]: procedures = 506, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 151 [2022-12-14 05:24:52,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:24:52,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:24:52,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:24:52,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:24:52,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,565 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:24:52,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:24:52,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:24:52,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:24:52,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (1/1) ... [2022-12-14 05:24:52,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:24:52,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:52,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:24:52,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:24:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-14 05:24:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-14 05:24:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-12-14 05:24:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-14 05:24:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-14 05:24:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:24:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-14 05:24:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:24:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:24:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:24:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2022-12-14 05:24:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2022-12-14 05:24:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:24:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2022-12-14 05:24:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2022-12-14 05:24:52,631 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-14 05:24:52,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:24:52,742 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:24:52,744 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:24:52,921 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:24:52,950 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:24:52,950 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 05:24:52,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:24:52 BoogieIcfgContainer [2022-12-14 05:24:52,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:24:52,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:24:52,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:24:52,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:24:52,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:24:51" (1/3) ... [2022-12-14 05:24:52,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206a3338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:24:52, skipping insertion in model container [2022-12-14 05:24:52,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:24:52" (2/3) ... [2022-12-14 05:24:52,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206a3338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:24:52, skipping insertion in model container [2022-12-14 05:24:52,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:24:52" (3/3) ... [2022-12-14 05:24:52,961 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_preinc_08_good.i [2022-12-14 05:24:52,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:24:52,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 05:24:53,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:24:53,024 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;@6e148884, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:24:53,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 05:24:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 05:24:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 05:24:53,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:53,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:53,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:53,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1267400723, now seen corresponding path program 1 times [2022-12-14 05:24:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:53,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821350828] [2022-12-14 05:24:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:24:53,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:53,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821350828] [2022-12-14 05:24:53,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821350828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:53,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:24:53,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:24:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703112214] [2022-12-14 05:24:53,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:53,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:24:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:53,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:24:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:24:53,270 INFO L87 Difference]: Start difference. First operand has 73 states, 40 states have (on average 1.475) internal successors, (59), 57 states have internal predecessors, (59), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:24:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:53,337 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2022-12-14 05:24:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:24:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-12-14 05:24:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:53,345 INFO L225 Difference]: With dead ends: 137 [2022-12-14 05:24:53,345 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 05:24:53,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:24:53,349 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:53,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 05:24:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-14 05:24:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 53 states have internal predecessors, (54), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 05:24:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-12-14 05:24:53,378 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 17 [2022-12-14 05:24:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:53,379 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-12-14 05:24:53,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:24:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-12-14 05:24:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:24:53,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:53,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:53,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:24:53,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1063666962, now seen corresponding path program 1 times [2022-12-14 05:24:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:53,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858284533] [2022-12-14 05:24:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:24:53,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:53,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858284533] [2022-12-14 05:24:53,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858284533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:53,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:24:53,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:24:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304037802] [2022-12-14 05:24:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:53,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:53,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:53,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:24:53,468 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:24:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:53,499 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-12-14 05:24:53,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2022-12-14 05:24:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:53,500 INFO L225 Difference]: With dead ends: 68 [2022-12-14 05:24:53,500 INFO L226 Difference]: Without dead ends: 67 [2022-12-14 05:24:53,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:24:53,501 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 41 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:53,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 97 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-14 05:24:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-14 05:24:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.394736842105263) internal successors, (53), 52 states have internal predecessors, (53), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 05:24:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-12-14 05:24:53,509 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 19 [2022-12-14 05:24:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:53,510 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-12-14 05:24:53,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 05:24:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-12-14 05:24:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 05:24:53,510 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:53,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:53,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:24:53,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1386062469, now seen corresponding path program 1 times [2022-12-14 05:24:53,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:53,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670206203] [2022-12-14 05:24:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:24:53,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:53,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670206203] [2022-12-14 05:24:53,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670206203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:53,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:24:53,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:24:53,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129803294] [2022-12-14 05:24:53,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:53,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:53,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:53,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:53,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:24:53,553 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:24:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:53,594 INFO L93 Difference]: Finished difference Result 162 states and 217 transitions. [2022-12-14 05:24:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-12-14 05:24:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:53,596 INFO L225 Difference]: With dead ends: 162 [2022-12-14 05:24:53,597 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 05:24:53,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:24:53,598 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 41 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:53,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 227 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 05:24:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 71. [2022-12-14 05:24:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 54 states have internal predecessors, (57), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2022-12-14 05:24:53,614 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 20 [2022-12-14 05:24:53,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:53,614 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2022-12-14 05:24:53,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 05:24:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2022-12-14 05:24:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 05:24:53,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:53,616 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:53,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 05:24:53,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:53,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:53,617 INFO L85 PathProgramCache]: Analyzing trace with hash -469412623, now seen corresponding path program 1 times [2022-12-14 05:24:53,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:53,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98174064] [2022-12-14 05:24:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:53,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 05:24:53,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:53,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98174064] [2022-12-14 05:24:53,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98174064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:53,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:24:53,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:24:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877212194] [2022-12-14 05:24:53,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:53,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:24:53,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:24:53,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:24:53,702 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 05:24:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:53,737 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2022-12-14 05:24:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:24:53,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 33 [2022-12-14 05:24:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:53,739 INFO L225 Difference]: With dead ends: 119 [2022-12-14 05:24:53,739 INFO L226 Difference]: Without dead ends: 70 [2022-12-14 05:24:53,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:24:53,741 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:53,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:53,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-14 05:24:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-12-14 05:24:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 53 states have internal predecessors, (55), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-12-14 05:24:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-12-14 05:24:53,752 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 33 [2022-12-14 05:24:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:53,752 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-12-14 05:24:53,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 05:24:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-12-14 05:24:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 05:24:53,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:53,754 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:53,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 05:24:53,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1400683356, now seen corresponding path program 1 times [2022-12-14 05:24:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:53,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498040855] [2022-12-14 05:24:53,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:24:53,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498040855] [2022-12-14 05:24:53,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498040855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:53,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209296632] [2022-12-14 05:24:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:53,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:53,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:53,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:53,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:24:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:53,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:24:53,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 05:24:53,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:24:53,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209296632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:53,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:24:53,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 05:24:53,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556590021] [2022-12-14 05:24:53,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:53,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:53,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:53,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:53,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:53,958 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 05:24:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:53,991 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2022-12-14 05:24:53,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:53,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2022-12-14 05:24:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:53,992 INFO L225 Difference]: With dead ends: 102 [2022-12-14 05:24:53,992 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 05:24:53,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:53,993 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:53,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 177 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 05:24:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2022-12-14 05:24:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 57 states have internal predecessors, (62), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2022-12-14 05:24:54,001 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 34 [2022-12-14 05:24:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:54,001 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2022-12-14 05:24:54,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 05:24:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2022-12-14 05:24:54,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 05:24:54,002 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:54,003 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:54,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:24:54,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:54,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:54,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 471511187, now seen corresponding path program 1 times [2022-12-14 05:24:54,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:54,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179589247] [2022-12-14 05:24:54,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:54,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:24:54,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179589247] [2022-12-14 05:24:54,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179589247] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821046805] [2022-12-14 05:24:54,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:54,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:54,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:54,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:54,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:24:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:54,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:24:54,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 05:24:54,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:24:54,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821046805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:54,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:24:54,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 05:24:54,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360488948] [2022-12-14 05:24:54,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:54,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:54,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:54,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:54,421 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 05:24:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:54,450 INFO L93 Difference]: Finished difference Result 133 states and 168 transitions. [2022-12-14 05:24:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 35 [2022-12-14 05:24:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:54,452 INFO L225 Difference]: With dead ends: 133 [2022-12-14 05:24:54,452 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 05:24:54,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:54,453 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:54,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 166 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 05:24:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 77. [2022-12-14 05:24:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2022-12-14 05:24:54,464 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 35 [2022-12-14 05:24:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:54,465 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2022-12-14 05:24:54,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 05:24:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2022-12-14 05:24:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 05:24:54,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:54,466 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:54,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 05:24:54,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:54,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash -545548895, now seen corresponding path program 1 times [2022-12-14 05:24:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:54,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500193223] [2022-12-14 05:24:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 05:24:54,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:54,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500193223] [2022-12-14 05:24:54,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500193223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:54,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:24:54,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:24:54,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017840047] [2022-12-14 05:24:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:54,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:24:54,844 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 05:24:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:54,868 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-12-14 05:24:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:54,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-12-14 05:24:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:54,869 INFO L225 Difference]: With dead ends: 77 [2022-12-14 05:24:54,869 INFO L226 Difference]: Without dead ends: 76 [2022-12-14 05:24:54,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:24:54,870 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 26 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:54,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 108 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-14 05:24:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-14 05:24:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 57 states have internal predecessors, (61), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2022-12-14 05:24:54,881 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 36 [2022-12-14 05:24:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:54,882 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2022-12-14 05:24:54,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 05:24:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2022-12-14 05:24:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 05:24:54,883 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:54,883 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:54,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 05:24:54,884 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 267853550, now seen corresponding path program 1 times [2022-12-14 05:24:54,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:54,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796220023] [2022-12-14 05:24:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 05:24:54,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:54,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796220023] [2022-12-14 05:24:54,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796220023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:54,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:24:54,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:24:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813090143] [2022-12-14 05:24:54,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:54,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:54,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:24:54,922 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 05:24:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:54,944 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2022-12-14 05:24:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:54,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 37 [2022-12-14 05:24:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:54,946 INFO L225 Difference]: With dead ends: 99 [2022-12-14 05:24:54,946 INFO L226 Difference]: Without dead ends: 98 [2022-12-14 05:24:54,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:24:54,947 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:54,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 168 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-14 05:24:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2022-12-14 05:24:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 54 states have internal predecessors, (58), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:54,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2022-12-14 05:24:54,959 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 37 [2022-12-14 05:24:54,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:54,960 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2022-12-14 05:24:54,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 05:24:54,960 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2022-12-14 05:24:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 05:24:54,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:54,962 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:54,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 05:24:54,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:54,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1403792302, now seen corresponding path program 1 times [2022-12-14 05:24:54,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:54,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388346981] [2022-12-14 05:24:54,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:54,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:24:55,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:55,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388346981] [2022-12-14 05:24:55,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388346981] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:55,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653368124] [2022-12-14 05:24:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:55,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:55,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:55,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:55,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:24:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:55,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:24:55,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 05:24:55,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:24:55,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653368124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:55,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:24:55,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 05:24:55,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737577103] [2022-12-14 05:24:55,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:55,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:55,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:55,118 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 05:24:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:55,145 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2022-12-14 05:24:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:55,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 44 [2022-12-14 05:24:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:55,147 INFO L225 Difference]: With dead ends: 90 [2022-12-14 05:24:55,147 INFO L226 Difference]: Without dead ends: 89 [2022-12-14 05:24:55,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:55,148 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:55,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 149 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-14 05:24:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2022-12-14 05:24:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 56 states have internal predecessors, (62), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 05:24:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2022-12-14 05:24:55,163 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 44 [2022-12-14 05:24:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:55,163 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-12-14 05:24:55,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 05:24:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2022-12-14 05:24:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 05:24:55,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:55,165 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:55,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:24:55,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:55,365 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -567888264, now seen corresponding path program 1 times [2022-12-14 05:24:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:55,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077123508] [2022-12-14 05:24:55,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:55,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 05:24:55,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:55,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077123508] [2022-12-14 05:24:55,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077123508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:55,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757459711] [2022-12-14 05:24:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:55,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:55,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:55,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:55,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:24:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:55,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:24:55,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 05:24:55,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:24:55,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757459711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:55,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:24:55,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 05:24:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794365] [2022-12-14 05:24:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:55,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:55,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:55,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:55,523 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 05:24:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:55,547 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-12-14 05:24:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 45 [2022-12-14 05:24:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:55,549 INFO L225 Difference]: With dead ends: 87 [2022-12-14 05:24:55,549 INFO L226 Difference]: Without dead ends: 86 [2022-12-14 05:24:55,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:55,549 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:55,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-14 05:24:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2022-12-14 05:24:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 55 states have internal predecessors, (61), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 05:24:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2022-12-14 05:24:55,556 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 45 [2022-12-14 05:24:55,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:55,556 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-12-14 05:24:55,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 05:24:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2022-12-14 05:24:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 05:24:55,557 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:55,557 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:55,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:24:55,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 05:24:55,758 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1862525076, now seen corresponding path program 1 times [2022-12-14 05:24:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:55,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247184828] [2022-12-14 05:24:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 05:24:55,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:55,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247184828] [2022-12-14 05:24:55,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247184828] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:55,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524237216] [2022-12-14 05:24:55,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:55,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:55,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:55,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:55,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:24:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:55,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 05:24:55,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 05:24:55,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:24:55,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524237216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:55,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:24:55,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 05:24:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433069064] [2022-12-14 05:24:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:55,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:24:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:55,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:24:55,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:55,906 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 05:24:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:55,924 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-12-14 05:24:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:24:55,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 47 [2022-12-14 05:24:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:55,926 INFO L225 Difference]: With dead ends: 76 [2022-12-14 05:24:55,926 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 05:24:55,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:24:55,927 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:55,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:55,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 05:24:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2022-12-14 05:24:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 52 states have internal predecessors, (56), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2022-12-14 05:24:55,932 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 47 [2022-12-14 05:24:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:55,932 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2022-12-14 05:24:55,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 05:24:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2022-12-14 05:24:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 05:24:55,933 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:55,933 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:55,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 05:24:56,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:56,134 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:56,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1390208929, now seen corresponding path program 1 times [2022-12-14 05:24:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:56,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678302766] [2022-12-14 05:24:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:24:56,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678302766] [2022-12-14 05:24:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678302766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545131045] [2022-12-14 05:24:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:56,243 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:56,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:24:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:56,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:24:56,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:24:56,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:24:56,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545131045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:56,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:24:56,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:24:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912816087] [2022-12-14 05:24:56,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:56,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:24:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:24:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:24:56,367 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 05:24:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:56,398 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-12-14 05:24:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:24:56,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 54 [2022-12-14 05:24:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:56,399 INFO L225 Difference]: With dead ends: 107 [2022-12-14 05:24:56,400 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 05:24:56,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:24:56,401 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:56,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 05:24:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-14 05:24:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-12-14 05:24:56,409 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 54 [2022-12-14 05:24:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:56,409 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-12-14 05:24:56,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 05:24:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-12-14 05:24:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 05:24:56,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:56,411 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:56,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:24:56,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 05:24:56,611 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1708855962, now seen corresponding path program 1 times [2022-12-14 05:24:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:56,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098063919] [2022-12-14 05:24:56,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 05:24:56,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:56,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098063919] [2022-12-14 05:24:56,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098063919] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:56,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122294194] [2022-12-14 05:24:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:56,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:56,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:56,665 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:56,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:24:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:56,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:24:56,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:24:56,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:24:56,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122294194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:56,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:24:56,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:24:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22602288] [2022-12-14 05:24:56,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:56,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:24:56,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:56,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:24:56,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:24:56,768 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 05:24:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:56,796 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2022-12-14 05:24:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:24:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 56 [2022-12-14 05:24:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:56,797 INFO L225 Difference]: With dead ends: 100 [2022-12-14 05:24:56,797 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 05:24:56,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:24:56,798 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:56,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 05:24:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-14 05:24:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 51 states have internal predecessors, (53), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2022-12-14 05:24:56,803 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 56 [2022-12-14 05:24:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:56,804 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2022-12-14 05:24:56,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 05:24:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-12-14 05:24:56,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 05:24:56,804 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:56,804 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:56,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 05:24:57,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 05:24:57,006 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:57,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:57,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1515513169, now seen corresponding path program 1 times [2022-12-14 05:24:57,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:57,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757342127] [2022-12-14 05:24:57,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:57,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:24:57,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:57,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757342127] [2022-12-14 05:24:57,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757342127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:57,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292100751] [2022-12-14 05:24:57,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:57,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:57,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:57,149 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:57,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:24:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:57,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 05:24:57,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 05:24:57,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:24:57,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292100751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:24:57,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:24:57,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:24:57,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644899030] [2022-12-14 05:24:57,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:24:57,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:24:57,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:57,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:24:57,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:24:57,255 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-14 05:24:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:57,282 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2022-12-14 05:24:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:24:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 60 [2022-12-14 05:24:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:57,284 INFO L225 Difference]: With dead ends: 83 [2022-12-14 05:24:57,284 INFO L226 Difference]: Without dead ends: 71 [2022-12-14 05:24:57,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:24:57,285 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:57,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:24:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-14 05:24:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-14 05:24:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 50 states have internal predecessors, (52), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 05:24:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-12-14 05:24:57,293 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 60 [2022-12-14 05:24:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:57,293 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-12-14 05:24:57,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-14 05:24:57,293 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-12-14 05:24:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-14 05:24:57,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:57,294 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:57,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:24:57,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:57,496 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:24:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1858339, now seen corresponding path program 1 times [2022-12-14 05:24:57,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:57,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776851439] [2022-12-14 05:24:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:24:57,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:57,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776851439] [2022-12-14 05:24:57,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776851439] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:57,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226339931] [2022-12-14 05:24:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:57,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:57,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:57,719 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:57,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:24:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:57,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:24:57,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:24:57,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:24:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:24:57,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226339931] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:24:57,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929727775] [2022-12-14 05:24:57,924 INFO L159 IcfgInterpreter]: Started Sifa with 50 locations of interest [2022-12-14 05:24:57,924 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:24:57,929 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:24:57,935 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:24:57,935 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:24:58,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:58,448 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 05:24:58,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 05:24:58,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:24:58,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:58,506 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 05:24:58,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 05:24:58,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:58,662 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:24:58,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:24:58,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:24:58,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:58,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:24:59,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,468 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:24:59,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:24:59,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,613 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:24:59,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:24:59,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,648 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:24:59,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:24:59,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:24:59,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:24:59,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:59,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:25:01,690 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 05:25:01,692 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-12-14 05:25:01,717 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 05:25:01,804 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-12-14 05:25:01,808 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:25:08,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [929727775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:25:08,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:25:08,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-12-14 05:25:08,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780848684] [2022-12-14 05:25:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:25:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 05:25:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:25:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 05:25:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1404, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 05:25:08,888 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:25:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:25:13,868 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2022-12-14 05:25:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 05:25:13,869 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 65 [2022-12-14 05:25:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:25:13,870 INFO L225 Difference]: With dead ends: 169 [2022-12-14 05:25:13,870 INFO L226 Difference]: Without dead ends: 125 [2022-12-14 05:25:13,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=281, Invalid=1881, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 05:25:13,871 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:25:13,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 456 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 05:25:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-14 05:25:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2022-12-14 05:25:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 76 states have internal predecessors, (78), 29 states have call successors, (29), 9 states have call predecessors, (29), 9 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-12-14 05:25:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2022-12-14 05:25:13,889 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 65 [2022-12-14 05:25:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:25:13,889 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2022-12-14 05:25:13,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:25:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2022-12-14 05:25:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 05:25:13,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:25:13,890 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:25:13,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 05:25:14,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:14,092 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:25:14,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:25:14,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1686223482, now seen corresponding path program 1 times [2022-12-14 05:25:14,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:25:14,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768953069] [2022-12-14 05:25:14,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:14,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:25:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:25:14,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:25:14,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768953069] [2022-12-14 05:25:14,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768953069] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:25:14,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766090] [2022-12-14 05:25:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:14,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:14,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:25:14,193 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:25:14,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:25:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:14,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:25:14,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:25:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:25:14,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:25:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:25:14,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766090] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:25:14,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [726426398] [2022-12-14 05:25:14,359 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 05:25:14,359 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:25:14,360 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:25:14,360 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:25:14,360 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:25:14,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:25:14,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:14,654 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:25:14,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:25:14,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:14,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 05:25:14,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:14,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 67 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-12-14 05:25:14,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:25:14,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:14,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:25:15,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:25:15,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:25:15,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,351 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:25:15,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:25:15,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,399 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:25:15,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:25:15,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,444 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 05:25:15,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 90 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 117 [2022-12-14 05:25:15,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:15,623 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 05:25:15,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 78 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 181 treesize of output 229 [2022-12-14 05:25:23,668 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 05:25:23,669 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 33 for LOIs [2022-12-14 05:25:23,671 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 28 for LOIs [2022-12-14 05:25:23,673 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 05:25:23,757 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:25:38,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [726426398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:25:38,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:25:38,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-12-14 05:25:38,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661402088] [2022-12-14 05:25:38,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:25:38,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 05:25:38,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:25:38,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 05:25:38,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 05:25:38,344 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 34 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:25:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:25:45,671 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2022-12-14 05:25:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 05:25:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-12-14 05:25:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:25:45,672 INFO L225 Difference]: With dead ends: 168 [2022-12-14 05:25:45,672 INFO L226 Difference]: Without dead ends: 82 [2022-12-14 05:25:45,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 153 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=379, Invalid=2483, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 05:25:45,673 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 74 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:25:45,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 394 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 05:25:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-14 05:25:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2022-12-14 05:25:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 51 states have internal predecessors, (52), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-14 05:25:45,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2022-12-14 05:25:45,683 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 67 [2022-12-14 05:25:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:25:45,683 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2022-12-14 05:25:45,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:25:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2022-12-14 05:25:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 05:25:45,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:25:45,684 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:25:45,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 05:25:45,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 05:25:45,886 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:25:45,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:25:45,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1977321428, now seen corresponding path program 1 times [2022-12-14 05:25:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:25:45,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48597060] [2022-12-14 05:25:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:25:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:25:45,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:25:45,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48597060] [2022-12-14 05:25:45,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48597060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:25:45,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590587834] [2022-12-14 05:25:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:45,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:45,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:25:45,980 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:25:45,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 05:25:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:46,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:25:46,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:25:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:25:46,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:25:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 05:25:46,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590587834] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:25:46,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [158825508] [2022-12-14 05:25:46,121 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-12-14 05:25:46,122 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:25:46,122 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:25:46,122 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:25:46,122 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:25:46,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:25:46,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:25:46,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:46,273 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 05:25:46,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 48 [2022-12-14 05:25:46,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:46,371 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 05:25:46,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 05:25:46,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:46,497 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:25:46,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:25:46,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:46,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:25:47,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,197 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:25:47,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:25:47,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,357 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:25:47,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:25:47,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,397 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:25:47,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:25:47,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:25:47,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:25:47,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:47,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:25:49,332 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 05:25:49,334 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 203 for LOIs [2022-12-14 05:25:49,433 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 05:25:49,529 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 05:25:49,614 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:26:01,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [158825508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:26:01,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:26:01,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-12-14 05:26:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660699566] [2022-12-14 05:26:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:26:01,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 05:26:01,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:26:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 05:26:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 05:26:01,152 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:26:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:26:07,223 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2022-12-14 05:26:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-14 05:26:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 67 [2022-12-14 05:26:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:26:07,225 INFO L225 Difference]: With dead ends: 138 [2022-12-14 05:26:07,225 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 05:26:07,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=321, Invalid=2229, Unknown=0, NotChecked=0, Total=2550 [2022-12-14 05:26:07,226 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 79 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:26:07,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 188 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-12-14 05:26:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 05:26:07,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2022-12-14 05:26:07,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 05:26:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-12-14 05:26:07,242 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 67 [2022-12-14 05:26:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:26:07,242 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-12-14 05:26:07,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:26:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-12-14 05:26:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 05:26:07,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:26:07,243 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:26:07,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 05:26:07,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 05:26:07,445 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 05:26:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:26:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1929987773, now seen corresponding path program 1 times [2022-12-14 05:26:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:26:07,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466219378] [2022-12-14 05:26:07,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:26:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:26:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:26:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:26:07,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:26:07,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466219378] [2022-12-14 05:26:07,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466219378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:26:07,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786722525] [2022-12-14 05:26:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:26:07,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:07,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:26:07,535 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:26:07,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 05:26:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:26:07,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:26:07,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:26:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:26:07,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:26:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 05:26:07,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786722525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:26:07,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2000771982] [2022-12-14 05:26:07,685 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-12-14 05:26:07,685 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:26:07,686 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:26:07,686 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:26:07,686 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:26:07,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:07,943 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 05:26:07,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 57 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 134 [2022-12-14 05:26:07,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,048 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 05:26:08,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 68 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 20 case distinctions, treesize of input 72 treesize of output 145 [2022-12-14 05:26:08,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:26:08,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2022-12-14 05:26:08,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:26:08,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:26:08,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,684 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 05:26:08,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 19 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-12-14 05:26:08,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,887 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 05:26:08,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 80 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 22 case distinctions, treesize of input 77 treesize of output 157 [2022-12-14 05:26:08,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:08,919 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:26:08,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 79 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 102 [2022-12-14 05:26:08,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:26:08,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 05:26:09,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:09,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 78 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 105 [2022-12-14 05:26:10,748 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 05:26:10,750 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 33 for LOIs [2022-12-14 05:26:10,751 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 05:26:10,826 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 05:26:10,832 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:26:20,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2000771982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:26:20,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:26:20,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-12-14 05:26:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020393549] [2022-12-14 05:26:20,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:26:20,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:26:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:26:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:26:20,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1556, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 05:26:20,446 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:26:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:26:29,048 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2022-12-14 05:26:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 05:26:29,049 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 69 [2022-12-14 05:26:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:26:29,049 INFO L225 Difference]: With dead ends: 129 [2022-12-14 05:26:29,049 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 05:26:29,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 164 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=475, Invalid=3307, Unknown=0, NotChecked=0, Total=3782 [2022-12-14 05:26:29,050 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:26:29,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 05:26:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 05:26:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 05:26:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:26:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 05:26:29,051 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2022-12-14 05:26:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:26:29,051 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 05:26:29,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 30 states have internal predecessors, (37), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 05:26:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 05:26:29,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 05:26:29,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 05:26:29,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 05:26:29,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 05:26:29,053 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 05:26:29,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 05:26:29,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 05:26:29,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 05:26:29,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 05:26:29,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 05:26:29,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:29,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 05:26:46,859 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-14 05:26:46,859 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-14 05:26:46,859 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2022-12-14 05:26:46,859 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1552 1555) the Hoare annotation is: true [2022-12-14 05:26:46,860 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-14 05:26:46,860 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-14 05:26:46,860 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1614) no Hoare annotation was computed. [2022-12-14 05:26:46,860 INFO L895 garLoopResultBuilder]: At program point L1596(line 1596) 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 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse27 (store ((as const (Array Int Int)) 0) 0 0)) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= .cse27 (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))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (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|) .cse27) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-12-14 05:26:46,860 INFO L899 garLoopResultBuilder]: For program point L1596-1(line 1596) no Hoare annotation was computed. [2022-12-14 05:26:46,860 INFO L899 garLoopResultBuilder]: For program point L1596-2(lines 1596 1609) no Hoare annotation was computed. [2022-12-14 05:26:46,861 INFO L895 garLoopResultBuilder]: At program point L1596-4(lines 1596 1609) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse12 (store ((as const (Array Int Int)) 0) 0 0)) (.cse20 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse12 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse12) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-12-14 05:26:46,861 INFO L895 garLoopResultBuilder]: At program point L1588(line 1588) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (store ((as const (Array Int Int)) 0) 0 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:26:46,861 INFO L899 garLoopResultBuilder]: For program point L1588-1(lines 1556 1591) no Hoare annotation was computed. [2022-12-14 05:26:46,861 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1589) no Hoare annotation was computed. [2022-12-14 05:26:46,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-12-14 05:26:46,861 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1582) no Hoare annotation was computed. [2022-12-14 05:26:46,861 INFO L895 garLoopResultBuilder]: At program point L1630(line 1630) the Hoare annotation is: false [2022-12-14 05:26:46,861 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1571) no Hoare annotation was computed. [2022-12-14 05:26:46,861 INFO L899 garLoopResultBuilder]: For program point L1614(line 1614) no Hoare annotation was computed. [2022-12-14 05:26:46,861 INFO L899 garLoopResultBuilder]: For program point L1614-1(line 1614) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L895 garLoopResultBuilder]: At program point L1672(line 1672) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1672-1(line 1672) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1639(line 1639) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) 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 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse6 (= (select (select |#memory_int| 2) 0) 0)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse9 (= (select |#valid| 9) 1)) (.cse10 (= (select |#valid| 11) 1)) (.cse11 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|)) (.cse12 (= (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))) (.cse13 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= ~globalArgv~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 1)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= 21 (select |#length| 4))) (.cse19 (= (select |#valid| 7) 1)) (.cse20 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= (select |#length| 10) 18)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse25 (= 16 (select |#length| 7))) (.cse26 (= (select |#length| 5) 54)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= 16 (select |#length| 3))) (.cse29 (= (select |#length| 2) 1)) (.cse30 (= (select |#valid| 1) 1)) (.cse31 (= 16 (select |#length| 11))) (.cse32 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= ~globalArgc~0 0)) (.cse43 (= (select |#valid| 6) 1)) (.cse44 (= (select |#length| 8) 54)) (.cse45 (= 5 ~globalFive~0)) (.cse46 (= (select |#valid| 10) 1)) (.cse47 (= (select |#valid| 8) 1)) (.cse48 (< 0 |#StackHeapBarrier|)) (.cse49 (= |#NULL.base| 0)) (.cse50 (= ~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 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50))) [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1639-1(line 1639) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1606-1(lines 1600 1607) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1582) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1582(line 1582) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1582-1(line 1582) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-12-14 05:26:46,862 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1574 1590) no Hoare annotation was computed. [2022-12-14 05:26:46,863 INFO L899 garLoopResultBuilder]: For program point L1624(lines 1624 1644) no Hoare annotation was computed. [2022-12-14 05:26:46,863 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: (let ((.cse44 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse42 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse53 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse54 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse13 (= 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))))) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= (select |#valid| 7) 1)) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= (select |#length| 10) 18)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (< |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse22 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse26 (= (select |#length| 5) 54)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= 16 (select |#length| 3))) (.cse29 (= (select |#length| 2) 1)) (.cse30 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse31 (= (select |#valid| 1) 1)) (.cse32 (= 16 (select |#length| 11))) (.cse33 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse34 (= ~globalArgv~0.base 0)) (.cse35 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse36 (= (select (select |#memory_int| 6) 0) 0)) (.cse37 (= (select |#valid| 0) 0)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse57 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse43 (= ~globalArgc~0 0)) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= (select |#length| 8) 54)) (.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 .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|) .cse44) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse53 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse54 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse55 .cse14 .cse15 .cse16 .cse56 .cse17 .cse18 .cse19 .cse20 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse53 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse57 .cse40 .cse41 .cse54 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse55 .cse14 .cse15 .cse16 .cse56 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse57 .cse40 .cse41 .cse43 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52)))) [2022-12-14 05:26:46,863 INFO L895 garLoopResultBuilder]: At program point L1616(line 1616) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse40 (store ((as const (Array Int Int)) 0) 0 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 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= (select |#length| 8) 54)) (.cse43 (= 5 ~globalFive~0)) (.cse44 (= (select |#valid| 10) 1)) (.cse45 (= (select |#valid| 8) 1)) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .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 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse40) (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)))) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse40 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse13 .cse14 .cse15 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48))) [2022-12-14 05:26:46,863 INFO L899 garLoopResultBuilder]: For program point L1649-1(line 1649) no Hoare annotation was computed. [2022-12-14 05:26:46,864 INFO L895 garLoopResultBuilder]: At program point L1649-4(lines 1649 1652) the Hoare annotation is: (let ((.cse20 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse40 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse31 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse41 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse55 (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))))) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.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|)) (.cse53 (< |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse54 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= 3 |ULTIMATE.start_goodG2B1_~data~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|)) (.cse32 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse57 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse42 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse43 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse53 .cse54 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .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|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse55 .cse13 .cse14 .cse15 .cse56 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse57 .cse38 .cse39 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse55 .cse13 .cse14 .cse15 .cse56 .cse16 .cse17 .cse18 .cse19 .cse53 .cse54 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse57 .cse38 .cse39 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-12-14 05:26:46,864 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-12-14 05:26:46,864 INFO L895 garLoopResultBuilder]: At program point L1641(line 1641) the Hoare annotation is: (let ((.cse55 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse13 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse55 (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))))) (.cse17 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse39 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse52 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= |ULTIMATE.start_goodG2B1_~result~2#1| |ULTIMATE.start_goodG2B1_~data~2#1|)) (.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|)) (.cse22 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#length| 5) 54)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= 3 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= 16 (select |#length| 11))) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse32 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse33 (= ~globalArgv~0.base 0)) (.cse34 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse54 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse42 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse43 (= ~globalArgc~0 0)) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (= (select |#valid| 10) 1)) (.cse48 (= (select |#valid| 8) 1)) (.cse49 (< 0 |#StackHeapBarrier|)) (.cse50 (= |#NULL.base| 0)) (.cse51 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse0 .cse1 .cse2 .cse52 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 (< |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) .cse53 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse54 .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|) .cse55) (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 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .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|) .cse55) (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 .cse40 .cse41 .cse54 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51)))) [2022-12-14 05:26:46,864 INFO L902 garLoopResultBuilder]: At program point L1674-1(line 1674) the Hoare annotation is: true [2022-12-14 05:26:46,865 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1607) no Hoare annotation was computed. [2022-12-14 05:26:46,865 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-12-14 05:26:46,865 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1623) no Hoare annotation was computed. [2022-12-14 05:26:46,865 INFO L895 garLoopResultBuilder]: At program point L1584(line 1584) 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) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| Int)) (and (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 14) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (store ((as const (Array Int Int)) 0) 0 0)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 10)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_6| 5)))) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:26:46,865 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: false [2022-12-14 05:26:46,865 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1639) no Hoare annotation was computed. [2022-12-14 05:26:46,865 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:26:46,865 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point L1560-2(lines 1560 1573) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1573) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 2)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 5)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8| 3)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_8|) 14))) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point L1610(line 1610) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point L1610-1(lines 1610 1622) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1639) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point L1636-1(lines 1636 1643) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point L1570-1(lines 1564 1571) no Hoare annotation was computed. [2022-12-14 05:26:46,866 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1614) no Hoare annotation was computed. [2022-12-14 05:26:46,867 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: (let ((.cse20 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse50 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse52 (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))))) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.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|)) (.cse51 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse54 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= (select |#length| 8) 54)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse50 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse51 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse52 .cse13 .cse14 .cse15 .cse53 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse54 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse50 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse52 .cse13 .cse14 .cse15 .cse53 .cse16 .cse17 .cse18 .cse19 (< |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) .cse51 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse54 .cse37 .cse38 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49)))) [2022-12-14 05:26:46,867 INFO L899 garLoopResultBuilder]: For program point L1628-1(line 1628) no Hoare annotation was computed. [2022-12-14 05:26:46,867 INFO L899 garLoopResultBuilder]: For program point L1628-2(lines 1628 1635) no Hoare annotation was computed. [2022-12-14 05:26:46,867 INFO L895 garLoopResultBuilder]: At program point L1628-3(lines 1628 1635) the Hoare annotation is: (let ((.cse20 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse50 (= |ULTIMATE.start_goodB2G2_~result~1#1| |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse53 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483647))) (.cse39 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse1 (= (select |#length| 9) 21)) (.cse2 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse3 (= (select |#length| 6) 1)) (.cse4 (= 1 (select |#valid| 5))) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse10 (= (select (select |#memory_int| 1) 0) 0)) (.cse11 (= ~globalArgv~0.offset 0)) (.cse12 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse51 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse13 (= (select |#valid| 3) 1)) (.cse14 (= 21 (select |#length| 4))) (.cse15 (= (select |#valid| 7) 1)) (.cse52 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647))) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse22 (= 16 (select |#length| 7))) (.cse23 (= (select |#length| 5) 54)) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= 16 (select |#length| 3))) (.cse26 (= (select |#length| 2) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= 16 (select |#length| 11))) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (= (select (select |#memory_int| 6) 0) 0)) (.cse34 (= (select |#valid| 0) 0)) (.cse35 (= (select |#length| 1) 1)) (.cse36 (= (select |#valid| 2) 1)) (.cse54 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse40 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (= (select |#valid| 6) 1)) (.cse43 (= (select |#length| 8) 54)) (.cse44 (= 5 ~globalFive~0)) (.cse45 (= (select |#valid| 10) 1)) (.cse46 (= (select |#valid| 8) 1)) (.cse47 (< 0 |#StackHeapBarrier|)) (.cse48 (= |#NULL.base| 0)) (.cse49 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse20) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse50 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse14 .cse15 .cse52 .cse16 .cse17 .cse18 .cse19 (< |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) .cse53 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse54 .cse37 .cse38 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse50 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse53 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse20) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4)))) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse51 .cse13 .cse14 .cse15 .cse52 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse54 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49)))) [2022-12-14 05:26:46,867 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-12-14 05:26:46,868 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) 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 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= (select |#length| 5) 54)) (.cse23 (= (select |#valid| 4) 1)) (.cse24 (= 16 (select |#length| 3))) (.cse25 (= (select |#length| 2) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= 16 (select |#length| 11))) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select (select |#memory_int| 6) 0) 0)) (.cse33 (= (select |#valid| 0) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= (select |#length| 8) 54)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (= (select |#valid| 10) 1)) (.cse44 (= (select |#valid| 8) 1)) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= |#NULL.base| 0)) (.cse47 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .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 .cse37 (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .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 (<= 0 (+ |ULTIMATE.start_goodB2G1_~result~0#1| 2147483647)) .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| |ULTIMATE.start_goodB2G1_~data~0#1|) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))) [2022-12-14 05:26:46,868 INFO L899 garLoopResultBuilder]: For program point L1653-1(lines 1653 1660) no Hoare annotation was computed. [2022-12-14 05:26:46,868 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1661) no Hoare annotation was computed. [2022-12-14 05:26:46,868 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1621) no Hoare annotation was computed. [2022-12-14 05:26:46,868 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-12-14 05:26:46,868 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2022-12-14 05:26:46,868 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1548 1551) the Hoare annotation is: true [2022-12-14 05:26:46,870 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:26:46,871 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 05:26:46,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:26:46 BoogieIcfgContainer [2022-12-14 05:26:46,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 05:26:46,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 05:26:46,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 05:26:46,878 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 05:26:46,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:24:52" (3/4) ... [2022-12-14 05:26:46,880 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 05:26:46,884 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-14 05:26:46,884 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2022-12-14 05:26:46,884 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-14 05:26:46,884 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2022-12-14 05:26:46,888 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-12-14 05:26:46,888 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-12-14 05:26:46,888 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 05:26:46,889 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 05:26:46,889 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 05:26:46,925 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 05:26:46,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 05:26:46,925 INFO L158 Benchmark]: Toolchain (without parser) took 115288.55ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 93.5MB in the beginning and 231.0MB in the end (delta: -137.4MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2022-12-14 05:26:46,925 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 107.0MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 05:26:46,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 870.70ms. Allocated memory is still 132.1MB. Free memory was 93.5MB in the beginning and 69.9MB in the end (delta: 23.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2022-12-14 05:26:46,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.41ms. Allocated memory is still 132.1MB. Free memory was 69.9MB in the beginning and 67.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 05:26:46,926 INFO L158 Benchmark]: Boogie Preprocessor took 19.81ms. Allocated memory is still 132.1MB. Free memory was 67.1MB in the beginning and 65.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 05:26:46,926 INFO L158 Benchmark]: RCFGBuilder took 383.51ms. Allocated memory is still 132.1MB. Free memory was 65.0MB in the beginning and 88.8MB in the end (delta: -23.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 05:26:46,926 INFO L158 Benchmark]: TraceAbstraction took 113922.72ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 88.8MB in the beginning and 70.0MB in the end (delta: 18.7MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. [2022-12-14 05:26:46,926 INFO L158 Benchmark]: Witness Printer took 47.18ms. Allocated memory is still 281.0MB. Free memory was 70.0MB in the beginning and 231.0MB in the end (delta: -160.9MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-12-14 05:26:46,927 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.16ms. Allocated memory is still 107.0MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 870.70ms. Allocated memory is still 132.1MB. Free memory was 93.5MB in the beginning and 69.9MB in the end (delta: 23.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.41ms. Allocated memory is still 132.1MB. Free memory was 69.9MB in the beginning and 67.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.81ms. Allocated memory is still 132.1MB. Free memory was 67.1MB in the beginning and 65.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.51ms. Allocated memory is still 132.1MB. Free memory was 65.0MB in the beginning and 88.8MB in the end (delta: -23.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 113922.72ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 88.8MB in the beginning and 70.0MB in the end (delta: 18.7MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. * Witness Printer took 47.18ms. Allocated memory is still 281.0MB. Free memory was 70.0MB in the beginning and 231.0MB in the end (delta: -160.9MB). Peak memory consumption was 4.7MB. 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: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1614]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1639]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1639]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: 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: 113.9s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 621 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 3677 SdHoareTripleChecker+Invalid, 12.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2292 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7397 IncrementalHoareTripleChecker+Invalid, 7582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 1385 mSDtfsCounter, 7397 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1274 GetRequests, 1013 SyntacticMatches, 20 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3177 ImplicationChecksByTransitivity, 56.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=15, InterpolantAutomatonStates: 231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 181 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 160 PreInvPairs, 213 NumberOfFragments, 9716 HoareAnnotationTreeSize, 160 FomulaSimplifications, 12176 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 25 FomulaSimplificationsInter, 33295 FormulaSimplificationTreeSizeReductionInter, 16.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1448 NumberOfCodeBlocks, 1448 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1682 ConstructedInterpolants, 0 QuantifiedInterpolants, 2064 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3072 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 34 InterpolantComputations, 14 PerfectInterpolantSequences, 787/816 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 19.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 236, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 156, TOOLS_POST_TIME: 7.6s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 6.5s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 3.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 396, TOOLS_QUANTIFIERELIM_TIME: 17.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 560, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 1.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 236, DOMAIN_ISBOTTOM_TIME: 0.5s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 96, CALL_SUMMARIZER_CACHE_MISSES: 16, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 7820, DAG_COMPRESSION_RETAINED_NODES: 572, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1674]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 05:26:46,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87e98bba-4b8a-4efc-8074-991683e88bff/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE