./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_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_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/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_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/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_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/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 91ca7f49b47c58892fdb758a58b795fbaf69396eb4fd769aff0472548ca480e5 --- 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 11:52:48,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:52:48,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:52:48,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:52:48,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:52:48,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:52:48,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:52:48,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:52:48,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:52:48,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:52:48,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:52:48,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:52:48,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:52:48,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:52:48,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:52:48,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:52:48,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:52:48,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:52:48,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:52:48,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:52:48,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:52:48,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:52:48,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:52:48,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:52:48,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:52:48,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:52:48,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:52:48,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:52:48,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:52:48,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:52:48,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:52:48,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:52:48,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:52:48,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:52:48,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:52:48,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:52:48,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:52:48,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:52:48,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:52:48,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:52:48,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:52:48,289 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 11:52:48,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:52:48,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:52:48,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:52:48,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:52:48,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:52:48,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:52:48,311 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:52:48,311 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:52:48,311 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:52:48,311 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:52:48,312 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:52:48,312 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:52:48,312 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:52:48,312 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:52:48,312 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:52:48,312 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:52:48,313 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:52:48,313 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:52:48,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:52:48,314 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 11:52:48,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:52:48,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:52:48,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:52:48,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:52:48,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:52:48,315 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 11:52:48,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:52:48,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:52:48,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:52:48,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:52:48,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:52:48,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:52:48,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:52:48,316 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:52:48,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:52:48,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:52:48,316 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:52:48,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:52:48,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:52:48,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:52:48,317 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_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/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_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/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 -> 91ca7f49b47c58892fdb758a58b795fbaf69396eb4fd769aff0472548ca480e5 [2022-12-14 11:52:48,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:52:48,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:52:48,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:52:48,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:52:48,549 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:52:48,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_good.i [2022-12-14 11:52:51,119 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:52:51,387 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:52:51,387 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_11_good.i [2022-12-14 11:52:51,408 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/data/16e9957f1/cd00d1eaade9479bae5ccd181e765081/FLAG2d8dc39a7 [2022-12-14 11:52:51,683 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/data/16e9957f1/cd00d1eaade9479bae5ccd181e765081 [2022-12-14 11:52:51,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:52:51,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:52:51,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:52:51,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:52:51,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:52:51,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:52:51" (1/1) ... [2022-12-14 11:52:51,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1490d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:51, skipping insertion in model container [2022-12-14 11:52:51,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:52:51" (1/1) ... [2022-12-14 11:52:51,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:52:51,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:52:51,959 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 11:52:52,232 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 11:52:52,236 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 11:52:52,237 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 11:52:52,239 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 11:52:52,239 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 11:52:52,256 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 11:52:52,261 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 11:52:52,268 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 11:52:52,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:52:52,277 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:52:52,291 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 11:52:52,334 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 11:52:52,336 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 11:52:52,337 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 11:52:52,339 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 11:52:52,340 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 11:52:52,346 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 11:52:52,349 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 11:52:52,360 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 11:52:52,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:52:52,451 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:52:52,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52 WrapperNode [2022-12-14 11:52:52,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:52:52,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:52:52,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:52:52,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:52:52,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,472 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,488 INFO L138 Inliner]: procedures = 504, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 143 [2022-12-14 11:52:52,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:52:52,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:52:52,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:52:52,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:52:52,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,505 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:52:52,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:52:52,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:52:52,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:52:52,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (1/1) ... [2022-12-14 11:52:52,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:52:52,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:52,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:52:52,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:52:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-14 11:52:52,565 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-14 11:52:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-12-14 11:52:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-14 11:52:52,565 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-14 11:52:52,565 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-12-14 11:52:52,566 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-12-14 11:52:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:52:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-14 11:52:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:52:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:52:52,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:52:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:52:52,566 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-12-14 11:52:52,567 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-12-14 11:52:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-14 11:52:52,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:52:52,669 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:52:52,670 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:52:52,849 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:52:52,881 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:52:52,881 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 11:52:52,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:52:52 BoogieIcfgContainer [2022-12-14 11:52:52,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:52:52,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:52:52,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:52:52,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:52:52,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:52:51" (1/3) ... [2022-12-14 11:52:52,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a26267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:52:52, skipping insertion in model container [2022-12-14 11:52:52,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:52:52" (2/3) ... [2022-12-14 11:52:52,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a26267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:52:52, skipping insertion in model container [2022-12-14 11:52:52,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:52:52" (3/3) ... [2022-12-14 11:52:52,892 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_11_good.i [2022-12-14 11:52:52,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:52:52,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 11:52:52,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:52:52,951 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;@23d12b03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:52:52,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 11:52:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 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 11:52:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 11:52:52,960 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:52,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:52,961 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 11:52:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:52,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1454760411, now seen corresponding path program 1 times [2022-12-14 11:52:52,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:52,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276257690] [2022-12-14 11:52:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:53,188 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 11:52:53,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:53,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276257690] [2022-12-14 11:52:53,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276257690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:53,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:53,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086886943] [2022-12-14 11:52:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:53,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:53,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:53,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:53,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:52:53,217 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 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 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 11:52:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:53,276 INFO L93 Difference]: Finished difference Result 145 states and 200 transitions. [2022-12-14 11:52:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-12-14 11:52:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:53,284 INFO L225 Difference]: With dead ends: 145 [2022-12-14 11:52:53,284 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 11:52:53,287 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 11:52:53,289 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 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 11:52:53,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 11:52:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-12-14 11:52:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 58 states have internal predecessors, (61), 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 11:52:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-12-14 11:52:53,318 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 18 [2022-12-14 11:52:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:53,319 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-12-14 11:52:53,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 11:52:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-12-14 11:52:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 11:52:53,321 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:53,321 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 11:52:53,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:52:53,321 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 11:52:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:53,322 INFO L85 PathProgramCache]: Analyzing trace with hash 588789408, now seen corresponding path program 1 times [2022-12-14 11:52:53,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:53,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175020836] [2022-12-14 11:52:53,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:53,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:53,381 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 11:52:53,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:53,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175020836] [2022-12-14 11:52:53,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175020836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:53,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:53,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:52:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662336941] [2022-12-14 11:52:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:53,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:52:53,385 INFO L87 Difference]: Start difference. First operand 72 states and 97 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 11:52:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:53,415 INFO L93 Difference]: Finished difference Result 115 states and 158 transitions. [2022-12-14 11:52:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:53,416 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 11:52:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:53,417 INFO L225 Difference]: With dead ends: 115 [2022-12-14 11:52:53,417 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 11:52:53,417 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 11:52:53,418 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 43 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:53,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 225 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 11:52:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2022-12-14 11:52:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 57 states have internal predecessors, (60), 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 11:52:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-12-14 11:52:53,426 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 20 [2022-12-14 11:52:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:53,426 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-12-14 11:52:53,426 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 11:52:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-12-14 11:52:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 11:52:53,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:53,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:52:53,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:52:53,427 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 11:52:53,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1072602544, now seen corresponding path program 1 times [2022-12-14 11:52:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:53,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818235103] [2022-12-14 11:52:53,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:53,477 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 11:52:53,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:53,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818235103] [2022-12-14 11:52:53,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818235103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:53,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:53,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:52:53,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227993715] [2022-12-14 11:52:53,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:53,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:53,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:53,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:53,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:52:53,479 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 11:52:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:53,516 INFO L93 Difference]: Finished difference Result 173 states and 236 transitions. [2022-12-14 11:52:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:53,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2022-12-14 11:52:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:53,518 INFO L225 Difference]: With dead ends: 173 [2022-12-14 11:52:53,518 INFO L226 Difference]: Without dead ends: 120 [2022-12-14 11:52:53,519 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 11:52:53,519 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:53,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 183 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-14 11:52:53,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 76. [2022-12-14 11:52:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 60 states have internal predecessors, (66), 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 11:52:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-12-14 11:52:53,528 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 21 [2022-12-14 11:52:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:53,528 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-12-14 11:52:53,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 11:52:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-12-14 11:52:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 11:52:53,529 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:53,529 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 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 11:52:53,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:52:53,529 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 11:52:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1064420024, now seen corresponding path program 1 times [2022-12-14 11:52:53,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:53,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359697099] [2022-12-14 11:52:53,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:52:53,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:53,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359697099] [2022-12-14 11:52:53,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359697099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:53,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227236085] [2022-12-14 11:52:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:53,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:53,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:52:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:53,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 11:52:53,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:52:53,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:53,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227236085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:53,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:53,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 11:52:53,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621391496] [2022-12-14 11:52:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:53,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:53,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:53,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:53,712 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:52:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:53,739 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2022-12-14 11:52:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-12-14 11:52:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:53,741 INFO L225 Difference]: With dead ends: 146 [2022-12-14 11:52:53,741 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 11:52:53,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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 11:52:53,743 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 25 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 192 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 11:52:53,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 192 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 11:52:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2022-12-14 11:52:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.392156862745098) internal successors, (71), 63 states have internal predecessors, (71), 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 11:52:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-12-14 11:52:53,750 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 32 [2022-12-14 11:52:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:53,750 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-12-14 11:52:53,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:52:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-12-14 11:52:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 11:52:53,751 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:53,751 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 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 11:52:53,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:52:53,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-14 11:52:53,952 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 11:52:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1061021213, now seen corresponding path program 1 times [2022-12-14 11:52:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:53,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251131891] [2022-12-14 11:52:53,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:52:54,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:54,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251131891] [2022-12-14 11:52:54,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251131891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:54,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:54,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:52:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060057375] [2022-12-14 11:52:54,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:54,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:54,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:52:54,005 INFO L87 Difference]: Start difference. First operand 81 states and 111 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 11:52:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:54,034 INFO L93 Difference]: Finished difference Result 106 states and 144 transitions. [2022-12-14 11:52:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:54,034 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2022-12-14 11:52:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:54,036 INFO L225 Difference]: With dead ends: 106 [2022-12-14 11:52:54,036 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 11:52:54,037 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 11:52:54,037 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:54,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 198 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 11:52:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2022-12-14 11:52:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 62 states have internal predecessors, (70), 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 11:52:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-12-14 11:52:54,045 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 34 [2022-12-14 11:52:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:54,045 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-12-14 11:52:54,045 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 11:52:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-12-14 11:52:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 11:52:54,046 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:54,046 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:52:54,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:52:54,047 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 11:52:54,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1468080885, now seen corresponding path program 1 times [2022-12-14 11:52:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:54,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773430885] [2022-12-14 11:52:54,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:54,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 11:52:54,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:54,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773430885] [2022-12-14 11:52:54,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773430885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:54,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:54,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:52:54,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091026480] [2022-12-14 11:52:54,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:54,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:54,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:54,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:54,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:52:54,105 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 11:52:54,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:54,130 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2022-12-14 11:52:54,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:54,131 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-12-14 11:52:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:54,132 INFO L225 Difference]: With dead ends: 105 [2022-12-14 11:52:54,132 INFO L226 Difference]: Without dead ends: 104 [2022-12-14 11:52:54,132 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 11:52:54,133 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 187 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 11:52:54,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 187 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-14 11:52:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-12-14 11:52:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 61 states have internal predecessors, (69), 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 11:52:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-12-14 11:52:54,139 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 35 [2022-12-14 11:52:54,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:54,139 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-12-14 11:52:54,139 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 11:52:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-12-14 11:52:54,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 11:52:54,140 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:54,140 INFO L195 NwaCegarLoop]: trace histogram [4, 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 11:52:54,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:52:54,140 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:52:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -690215343, now seen corresponding path program 1 times [2022-12-14 11:52:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:54,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746790698] [2022-12-14 11:52:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 11:52:54,189 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:54,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746790698] [2022-12-14 11:52:54,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746790698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:54,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072348565] [2022-12-14 11:52:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:54,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:54,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:54,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:54,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:52:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:54,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 11:52:54,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 11:52:54,283 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:54,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072348565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:54,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:54,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 11:52:54,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068462525] [2022-12-14 11:52:54,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:54,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:54,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:54,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:54,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:54,285 INFO L87 Difference]: Start difference. First operand 79 states and 109 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 11:52:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:54,310 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2022-12-14 11:52:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:54,311 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2022-12-14 11:52:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:54,312 INFO L225 Difference]: With dead ends: 111 [2022-12-14 11:52:54,312 INFO L226 Difference]: Without dead ends: 97 [2022-12-14 11:52:54,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 11:52:54,313 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:54,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-14 11:52:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2022-12-14 11:52:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 64 states have internal predecessors, (74), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 11:52:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-12-14 11:52:54,319 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 42 [2022-12-14 11:52:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:54,319 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-12-14 11:52:54,320 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 11:52:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-12-14 11:52:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 11:52:54,320 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:54,321 INFO L195 NwaCegarLoop]: trace histogram [4, 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 11:52:54,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 11:52:54,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:54,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:52:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash 78161000, now seen corresponding path program 1 times [2022-12-14 11:52:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:54,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434474690] [2022-12-14 11:52:54,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 11:52:54,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:54,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434474690] [2022-12-14 11:52:54,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434474690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:54,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391185063] [2022-12-14 11:52:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:54,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:54,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:54,570 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:54,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:52:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:54,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 11:52:54,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 11:52:54,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:54,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391185063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:54,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:54,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 11:52:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493431949] [2022-12-14 11:52:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:54,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:54,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:54,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:54,671 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 11:52:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:54,691 INFO L93 Difference]: Finished difference Result 84 states and 116 transitions. [2022-12-14 11:52:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:54,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-12-14 11:52:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:54,693 INFO L225 Difference]: With dead ends: 84 [2022-12-14 11:52:54,693 INFO L226 Difference]: Without dead ends: 83 [2022-12-14 11:52:54,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 11:52:54,694 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 142 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 11:52:54,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-14 11:52:54,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-12-14 11:52:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 63 states have internal predecessors, (73), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 11:52:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2022-12-14 11:52:54,700 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 43 [2022-12-14 11:52:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:54,701 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2022-12-14 11:52:54,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 11:52:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2022-12-14 11:52:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 11:52:54,702 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:54,703 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 11:52:54,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:52:54,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:54,904 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 11:52:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 990475899, now seen corresponding path program 1 times [2022-12-14 11:52:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:54,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644838990] [2022-12-14 11:52:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:55,061 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 11:52:55,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:55,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644838990] [2022-12-14 11:52:55,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644838990] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:55,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690615946] [2022-12-14 11:52:55,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:55,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:55,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:55,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:55,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:52:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:55,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 11:52:55,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:55,163 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 11:52:55,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:55,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690615946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:55,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:55,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 11:52:55,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151445077] [2022-12-14 11:52:55,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:55,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:55,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:55,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:55,165 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 3 states, 3 states have (on average 8.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 11:52:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:55,185 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-12-14 11:52:55,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:55,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.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 11:52:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:55,186 INFO L225 Difference]: With dead ends: 111 [2022-12-14 11:52:55,186 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 11:52:55,186 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 11:52:55,187 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:55,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 11:52:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2022-12-14 11:52:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 61 states have internal predecessors, (70), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 11:52:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-12-14 11:52:55,194 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 45 [2022-12-14 11:52:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:55,195 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-12-14 11:52:55,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.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 11:52:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-12-14 11:52:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 11:52:55,196 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:55,197 INFO L195 NwaCegarLoop]: trace histogram [6, 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 11:52:55,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 11:52:55,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:55,398 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:52:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:55,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1371327926, now seen corresponding path program 1 times [2022-12-14 11:52:55,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:55,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66529826] [2022-12-14 11:52:55,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:52:55,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66529826] [2022-12-14 11:52:55,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66529826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:55,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224186073] [2022-12-14 11:52:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:55,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:55,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:55,568 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:55,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:52:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:55,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 11:52:55,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 11:52:55,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:55,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224186073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:55,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:55,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 11:52:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730649683] [2022-12-14 11:52:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:55,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:52:55,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:52:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:52:55,658 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 11:52:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:55,674 INFO L93 Difference]: Finished difference Result 81 states and 112 transitions. [2022-12-14 11:52:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:52:55,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 52 [2022-12-14 11:52:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:55,675 INFO L225 Difference]: With dead ends: 81 [2022-12-14 11:52:55,675 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 11:52:55,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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 11:52:55,676 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:52:55,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 162 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 11:52:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 11:52:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 60 states have internal predecessors, (69), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 11:52:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2022-12-14 11:52:55,683 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 52 [2022-12-14 11:52:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:55,683 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2022-12-14 11:52:55,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-12-14 11:52:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2022-12-14 11:52:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 11:52:55,693 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:55,693 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 11:52:55,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 11:52:55,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:55,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:52:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash 438507435, now seen corresponding path program 1 times [2022-12-14 11:52:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:55,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327605249] [2022-12-14 11:52:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:52:55,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:55,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327605249] [2022-12-14 11:52:55,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327605249] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:55,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105767622] [2022-12-14 11:52:55,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:55,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:55,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:55,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:55,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 11:52:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:56,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 11:52:56,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 11:52:56,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:56,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105767622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:56,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:56,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 11:52:56,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289693828] [2022-12-14 11:52:56,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:56,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:52:56,034 INFO L87 Difference]: Start difference. First operand 80 states and 111 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 11:52:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:56,062 INFO L93 Difference]: Finished difference Result 118 states and 156 transitions. [2022-12-14 11:52:56,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:56,062 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2022-12-14 11:52:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:56,063 INFO L225 Difference]: With dead ends: 118 [2022-12-14 11:52:56,063 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 11:52:56,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 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 11:52:56,064 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 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 11:52:56,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 11:52:56,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 11:52:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 11:52:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-12-14 11:52:56,071 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 53 [2022-12-14 11:52:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:56,071 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-12-14 11:52:56,071 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 11:52:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-12-14 11:52:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 11:52:56,072 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:56,072 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 11:52:56,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 11:52:56,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 11:52:56,274 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:52:56,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1490503184, now seen corresponding path program 1 times [2022-12-14 11:52:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:56,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936424194] [2022-12-14 11:52:56,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:56,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:52:56,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:56,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936424194] [2022-12-14 11:52:56,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936424194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:56,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320836837] [2022-12-14 11:52:56,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:56,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:56,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:56,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:56,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 11:52:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:56,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 11:52:56,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 11:52:56,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:56,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320836837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:56,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:56,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 11:52:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977737842] [2022-12-14 11:52:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:52:56,526 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 11:52:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:56,552 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2022-12-14 11:52:56,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:56,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-12-14 11:52:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:56,554 INFO L225 Difference]: With dead ends: 114 [2022-12-14 11:52:56,554 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 11:52:56,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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 11:52:56,555 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 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 11:52:56,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 11:52:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 11:52:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 60 states have internal predecessors, (66), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 11:52:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2022-12-14 11:52:56,560 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 55 [2022-12-14 11:52:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:56,560 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2022-12-14 11:52:56,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 11:52:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-12-14 11:52:56,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 11:52:56,561 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:56,561 INFO L195 NwaCegarLoop]: trace histogram [6, 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] [2022-12-14 11:52:56,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 11:52:56,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 11:52:56,762 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:52:56,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:56,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2010427973, now seen corresponding path program 1 times [2022-12-14 11:52:56,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:56,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008972796] [2022-12-14 11:52:56,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:52:56,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008972796] [2022-12-14 11:52:56,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008972796] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362488313] [2022-12-14 11:52:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:56,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:56,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:56,835 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:56,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 11:52:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:56,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 11:52:56,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 11:52:56,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:52:56,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362488313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:56,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:52:56,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 11:52:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804504486] [2022-12-14 11:52:56,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:56,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:56,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:52:56,934 INFO L87 Difference]: Start difference. First operand 80 states and 108 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 11:52:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:56,957 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-12-14 11:52:56,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:56,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2022-12-14 11:52:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:56,958 INFO L225 Difference]: With dead ends: 92 [2022-12-14 11:52:56,958 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 11:52:56,958 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 11:52:56,959 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 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 11:52:56,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:56,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 11:52:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 11:52:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 60 states have internal predecessors, (64), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 11:52:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2022-12-14 11:52:56,964 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 56 [2022-12-14 11:52:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:56,965 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2022-12-14 11:52:56,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 11:52:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2022-12-14 11:52:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 11:52:56,966 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:56,966 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, 1, 1, 1, 1] [2022-12-14 11:52:56,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 11:52:57,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:57,167 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:52:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:57,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1034466036, now seen corresponding path program 1 times [2022-12-14 11:52:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:57,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121707322] [2022-12-14 11:52:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:57,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 11:52:57,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:57,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121707322] [2022-12-14 11:52:57,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121707322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:52:57,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:52:57,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:52:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290592276] [2022-12-14 11:52:57,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:52:57,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:52:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:52:57,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:52:57,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:52:57,212 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 11:52:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:52:57,232 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-12-14 11:52:57,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:52:57,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-12-14 11:52:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:52:57,233 INFO L225 Difference]: With dead ends: 94 [2022-12-14 11:52:57,233 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 11:52:57,233 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 11:52:57,234 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 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 11:52:57,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:52:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 11:52:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-12-14 11:52:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 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 11:52:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-12-14 11:52:57,239 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 60 [2022-12-14 11:52:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:52:57,239 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-12-14 11:52:57,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 11:52:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-12-14 11:52:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 11:52:57,240 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:52:57,240 INFO L195 NwaCegarLoop]: trace histogram [6, 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 11:52:57,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 11:52:57,241 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:52:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:52:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1916388764, now seen corresponding path program 1 times [2022-12-14 11:52:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:52:57,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495829814] [2022-12-14 11:52:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:52:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:52:57,337 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:52:57,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495829814] [2022-12-14 11:52:57,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495829814] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:52:57,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741527979] [2022-12-14 11:52:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:52:57,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:52:57,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:52:57,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:52:57,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 11:52:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:52:57,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:52:57,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:52:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:52:57,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:52:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 11:52:57,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741527979] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:52:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1385023603] [2022-12-14 11:52:57,561 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-12-14 11:52:57,561 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:52:57,564 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:52:57,568 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:52:57,568 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:52:57,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:57,944 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 11:52:57,945 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 11:52:57,975 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 11:52:57,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:58,011 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 11:52:58,011 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 11:52:58,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:58,176 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:52:58,176 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 11:52:58,207 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 11:52:58,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:58,284 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 11:52:58,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:58,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:58,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:58,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:58,833 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:52:58,834 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 11:52:58,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:58,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:59,026 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 11:52:59,027 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 11:52:59,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:59,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:59,062 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:52:59,062 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 11:52:59,119 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 11:52:59,134 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 11:52:59,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:52:59,238 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 11:53:00,877 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:53:00,879 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-12-14 11:53:00,907 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 11:53:00,992 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 11:53:01,000 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:53:09,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1385023603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:53:09,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:53:09,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-12-14 11:53:09,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035400685] [2022-12-14 11:53:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:53:09,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 11:53:09,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:53:09,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 11:53:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 11:53:09,202 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 11:53:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:53:27,987 INFO L93 Difference]: Finished difference Result 304 states and 377 transitions. [2022-12-14 11:53:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-14 11:53:27,988 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 62 [2022-12-14 11:53:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:53:27,988 INFO L225 Difference]: With dead ends: 304 [2022-12-14 11:53:27,988 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 11:53:27,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=893, Invalid=5427, Unknown=0, NotChecked=0, Total=6320 [2022-12-14 11:53:27,990 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 171 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-12-14 11:53:27,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 397 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-12-14 11:53:27,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 11:53:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 113. [2022-12-14 11:53:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 81 states have internal predecessors, (83), 27 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-12-14 11:53:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2022-12-14 11:53:28,008 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 62 [2022-12-14 11:53:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:53:28,008 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2022-12-14 11:53:28,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-12-14 11:53:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-12-14 11:53:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 11:53:28,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:53:28,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:53:28,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 11:53:28,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:53:28,211 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:53:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:53:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1478328706, now seen corresponding path program 1 times [2022-12-14 11:53:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:53:28,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606466925] [2022-12-14 11:53:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:53:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:53:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:53:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:53:28,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:53:28,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606466925] [2022-12-14 11:53:28,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606466925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:53:28,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435800316] [2022-12-14 11:53:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:53:28,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:53:28,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:53:28,320 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:53:28,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 11:53:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:53:28,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:53:28,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:53:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:53:28,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:53:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:53:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435800316] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:53:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [309415697] [2022-12-14 11:53:28,479 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-12-14 11:53:28,479 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:53:28,479 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:53:28,480 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:53:28,480 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:53:28,614 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 11:53:28,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:28,745 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:53:28,745 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 11:53:28,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:28,761 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 11:53:28,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:28,774 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 11:53:28,792 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 11:53:28,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:28,848 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 11:53:29,276 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 11:53:29,282 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 11:53:29,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,316 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:53:29,316 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 11:53:29,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,359 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:53:29,360 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 11:53:29,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,407 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 11:53:29,408 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 11:53:29,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:53:29,582 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 11:53:29,583 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 11:53:36,417 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:53:36,418 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 209 for LOIs [2022-12-14 11:53:36,509 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 28 for LOIs [2022-12-14 11:53:36,510 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 63 for LOIs [2022-12-14 11:53:36,518 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:53:52,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [309415697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:53:52,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:53:52,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-12-14 11:53:52,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214602301] [2022-12-14 11:53:52,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:53:52,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 11:53:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:53:52,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 11:53:52,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 11:53:52,481 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 34 states, 25 states have (on average 1.48) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 11:54:02,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:54:02,094 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2022-12-14 11:54:02,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 11:54:02,095 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 1.48) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 66 [2022-12-14 11:54:02,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:54:02,096 INFO L225 Difference]: With dead ends: 202 [2022-12-14 11:54:02,096 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 11:54:02,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 146 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=503, Invalid=3037, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 11:54:02,097 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 108 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 11:54:02,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 527 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-12-14 11:54:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 11:54:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 114. [2022-12-14 11:54:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 77 states have (on average 1.077922077922078) internal successors, (83), 81 states have internal predecessors, (83), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-12-14 11:54:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2022-12-14 11:54:02,116 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 66 [2022-12-14 11:54:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:54:02,116 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2022-12-14 11:54:02,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 1.48) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 11:54:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2022-12-14 11:54:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 11:54:02,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:54:02,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:54:02,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 11:54:02,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 11:54:02,319 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:54:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:54:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash -181084142, now seen corresponding path program 1 times [2022-12-14 11:54:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:54:02,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263399529] [2022-12-14 11:54:02,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:54:02,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:54:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:54:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:02,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:54:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263399529] [2022-12-14 11:54:02,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263399529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:54:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194707540] [2022-12-14 11:54:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:54:02,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:54:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:54:02,412 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:54:02,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 11:54:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:54:02,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:54:02,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:02,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:54:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:02,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194707540] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:02,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021836585] [2022-12-14 11:54:02,574 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-12-14 11:54:02,575 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:54:02,575 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:54:02,575 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:54:02,575 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:54:02,707 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 11:54:02,711 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 11:54:02,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:02,728 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 11:54:02,729 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 11:54:02,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:02,817 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 11:54:02,817 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 11:54:02,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:02,963 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:54:02,963 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 11:54:03,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,023 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 11:54:03,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,589 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:54:03,589 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 11:54:03,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,735 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 11:54:03,735 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 11:54:03,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,769 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:54:03,769 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 11:54:03,800 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 11:54:03,807 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 11:54:03,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:03,885 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 11:54:05,479 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:54:05,484 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-12-14 11:54:05,507 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 11:54:05,590 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 11:54:05,672 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:54:15,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1021836585] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:54:15,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:54:15,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-12-14 11:54:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900569296] [2022-12-14 11:54:15,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:54:15,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 11:54:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:54:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 11:54:15,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 11:54:15,343 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 35 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 11:54:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:54:24,138 INFO L93 Difference]: Finished difference Result 219 states and 255 transitions. [2022-12-14 11:54:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 11:54:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 66 [2022-12-14 11:54:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:54:24,139 INFO L225 Difference]: With dead ends: 219 [2022-12-14 11:54:24,139 INFO L226 Difference]: Without dead ends: 170 [2022-12-14 11:54:24,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 155 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=454, Invalid=2738, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 11:54:24,140 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 127 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-12-14 11:54:24,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 440 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-12-14 11:54:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-14 11:54:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2022-12-14 11:54:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 105 states have (on average 1.0666666666666667) internal successors, (112), 110 states have internal predecessors, (112), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-12-14 11:54:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2022-12-14 11:54:24,171 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 66 [2022-12-14 11:54:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:54:24,171 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2022-12-14 11:54:24,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 29 states have internal predecessors, (37), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 11:54:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2022-12-14 11:54:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 11:54:24,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:54:24,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:54:24,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 11:54:24,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 11:54:24,374 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:54:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:54:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash -904280985, now seen corresponding path program 1 times [2022-12-14 11:54:24,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:54:24,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026302627] [2022-12-14 11:54:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:54:24,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:54:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:54:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:24,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:54:24,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026302627] [2022-12-14 11:54:24,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026302627] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:54:24,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071667138] [2022-12-14 11:54:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:54:24,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:54:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:54:24,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:54:24,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 11:54:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:54:24,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:54:24,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:24,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:54:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:24,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071667138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:24,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2135668767] [2022-12-14 11:54:24,621 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-12-14 11:54:24,621 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:54:24,621 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:54:24,622 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:54:24,622 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:54:24,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:24,808 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 11:54:24,808 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 11:54:24,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:24,918 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:54:24,919 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 11:54:24,940 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 11:54:24,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:24,952 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 11:54:24,961 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 11:54:25,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,006 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 11:54:25,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,388 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:54:25,388 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 11:54:25,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,546 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 11:54:25,547 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 11:54:25,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,579 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:54:25,580 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 11:54:25,617 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 11:54:25,628 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 11:54:25,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:25,709 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 11:54:27,537 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:54:27,538 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 181 for LOIs [2022-12-14 11:54:27,634 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 11:54:27,711 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 11:54:27,718 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:54:37,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2135668767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:54:37,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:54:37,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-12-14 11:54:37,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693192816] [2022-12-14 11:54:37,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:54:37,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 11:54:37,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:54:37,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 11:54:37,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 11:54:37,918 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 11:54:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:54:47,758 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2022-12-14 11:54:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-14 11:54:47,759 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 68 [2022-12-14 11:54:47,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:54:47,760 INFO L225 Difference]: With dead ends: 198 [2022-12-14 11:54:47,760 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 11:54:47,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 158 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=604, Invalid=3428, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 11:54:47,762 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 96 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:54:47,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 238 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-12-14 11:54:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 11:54:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-12-14 11:54:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 81 states have internal predecessors, (82), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 11:54:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2022-12-14 11:54:47,783 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 68 [2022-12-14 11:54:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:54:47,783 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2022-12-14 11:54:47,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 11:54:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2022-12-14 11:54:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 11:54:47,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:54:47,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:54:47,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 11:54:47,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 11:54:47,986 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:54:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:54:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash -178959877, now seen corresponding path program 1 times [2022-12-14 11:54:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:54:47,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349478216] [2022-12-14 11:54:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:54:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:54:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:54:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:48,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:54:48,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349478216] [2022-12-14 11:54:48,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349478216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:54:48,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868037731] [2022-12-14 11:54:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:54:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:54:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:54:48,077 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:54:48,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 11:54:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:54:48,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:54:48,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:54:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:48,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:54:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:54:48,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868037731] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:54:48,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [611102476] [2022-12-14 11:54:48,229 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-12-14 11:54:48,229 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:54:48,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:54:48,229 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:54:48,229 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:54:48,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:48,401 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 11:54:48,401 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 11:54:48,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:48,489 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 11:54:48,489 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 11:54:48,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:48,617 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:54:48,617 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 11:54:48,637 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 11:54:48,646 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 11:54:48,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:48,699 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 11:54:49,286 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 11:54:49,290 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 11:54:49,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,323 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:54:49,324 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 11:54:49,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,366 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:54:49,367 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 11:54:49,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,460 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-12-14 11:54:49,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-12-14 11:54:49,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:54:49,608 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 11:54:49,609 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 157 treesize of output 205 [2022-12-14 11:54:50,232 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:54:50,233 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 181 for LOIs [2022-12-14 11:54:50,295 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-12-14 11:54:50,344 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 11:54:50,351 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:54:56,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [611102476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:54:56,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:54:56,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-12-14 11:54:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266811218] [2022-12-14 11:54:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:54:56,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 11:54:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:54:56,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 11:54:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 11:54:56,344 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand has 36 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 11:55:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:55:06,529 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2022-12-14 11:55:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 11:55:06,530 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 68 [2022-12-14 11:55:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:55:06,531 INFO L225 Difference]: With dead ends: 166 [2022-12-14 11:55:06,531 INFO L226 Difference]: Without dead ends: 115 [2022-12-14 11:55:06,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 156 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=589, Invalid=3443, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 11:55:06,532 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 204 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 11:55:06,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 468 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-12-14 11:55:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-14 11:55:06,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2022-12-14 11:55:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 75 states have internal predecessors, (75), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 11:55:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-12-14 11:55:06,554 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 68 [2022-12-14 11:55:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:55:06,554 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-12-14 11:55:06,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-14 11:55:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-12-14 11:55:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 11:55:06,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:55:06,554 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, 1] [2022-12-14 11:55:06,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 11:55:06,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:06,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:55:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:55:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -955605716, now seen corresponding path program 1 times [2022-12-14 11:55:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:55:06,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56417147] [2022-12-14 11:55:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:55:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:55:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:55:06,853 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 11:55:06,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:55:06,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56417147] [2022-12-14 11:55:06,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56417147] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:55:06,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227669280] [2022-12-14 11:55:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:55:06,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:06,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:55:06,854 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:55:06,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 11:55:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:55:06,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:55:06,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:06,963 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 11:55:06,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:07,014 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 11:55:07,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227669280] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:07,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [542252906] [2022-12-14 11:55:07,016 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-12-14 11:55:07,016 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:55:07,017 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:55:07,017 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:55:07,017 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:55:07,137 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 11:55:07,143 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 11:55:07,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:07,248 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 11:55:07,248 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 11:55:07,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:07,290 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 11:55:07,290 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 11:55:07,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:07,406 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:55:07,407 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 11:55:07,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:07,479 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 11:55:08,048 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 11:55:08,052 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 11:55:08,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,073 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:55:08,073 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 11:55:08,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,193 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 11:55:08,194 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 11:55:08,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,225 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:55:08,225 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 11:55:08,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:08,328 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 11:55:10,001 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:55:10,002 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-12-14 11:55:10,023 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 11:55:10,097 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-12-14 11:55:10,099 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:55:18,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [542252906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:55:18,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:55:18,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-12-14 11:55:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429174295] [2022-12-14 11:55:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:55:18,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 11:55:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:55:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 11:55:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 11:55:18,792 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 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 11:55:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:55:21,743 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-12-14 11:55:21,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 11:55:21,744 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 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 70 [2022-12-14 11:55:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:55:21,744 INFO L225 Difference]: With dead ends: 138 [2022-12-14 11:55:21,744 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 11:55:21,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=300, Invalid=1770, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 11:55:21,745 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 96 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:55:21,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 157 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-12-14 11:55:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 11:55:21,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2022-12-14 11:55:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.028169014084507) internal successors, (73), 73 states have internal predecessors, (73), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 11:55:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-12-14 11:55:21,771 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 70 [2022-12-14 11:55:21,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:55:21,771 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-12-14 11:55:21,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 30 states have internal predecessors, (38), 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 11:55:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-12-14 11:55:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 11:55:21,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:55:21,772 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, 1, 1, 1, 1, 1] [2022-12-14 11:55:21,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 11:55:21,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:21,973 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:55:21,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:55:21,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1078661227, now seen corresponding path program 1 times [2022-12-14 11:55:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:55:21,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755347165] [2022-12-14 11:55:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:55:21,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:55:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:55:22,043 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 11:55:22,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:55:22,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755347165] [2022-12-14 11:55:22,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755347165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:55:22,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447565148] [2022-12-14 11:55:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:55:22,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:22,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:55:22,045 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:55:22,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 11:55:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:55:22,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:55:22,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:22,142 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 11:55:22,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:22,191 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 11:55:22,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447565148] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:22,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [544946653] [2022-12-14 11:55:22,193 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-12-14 11:55:22,193 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:55:22,194 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:55:22,194 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:55:22,194 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:55:22,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:22,435 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:55:22,435 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 11:55:22,450 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 11:55:22,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:22,457 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 11:55:22,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:22,469 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 11:55:22,483 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 11:55:22,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:22,522 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 11:55:23,019 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 11:55:23,024 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 11:55:23,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,053 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:55:23,053 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 11:55:23,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,089 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:55:23,089 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 11:55:23,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,188 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-12-14 11:55:23,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 84 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 14 case distinctions, treesize of input 77 treesize of output 141 [2022-12-14 11:55:23,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:23,330 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 11:55:23,330 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 157 treesize of output 205 [2022-12-14 11:55:24,002 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:55:24,003 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 76 for LOIs [2022-12-14 11:55:24,013 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 160 for LOIs [2022-12-14 11:55:24,057 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 11:55:24,130 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:55:30,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [544946653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:55:30,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:55:30,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 43 [2022-12-14 11:55:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490055202] [2022-12-14 11:55:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:55:30,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 11:55:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:55:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 11:55:30,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 11:55:30,965 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 37 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 32 states have internal predecessors, (40), 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 11:55:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:55:36,792 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-12-14 11:55:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 11:55:36,793 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 32 states have internal predecessors, (40), 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 72 [2022-12-14 11:55:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:55:36,793 INFO L225 Difference]: With dead ends: 112 [2022-12-14 11:55:36,793 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 11:55:36,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 167 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=456, Invalid=2736, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 11:55:36,794 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 107 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:55:36,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 161 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 11:55:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 11:55:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-14 11:55:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-12-14 11:55:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-12-14 11:55:36,808 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 72 [2022-12-14 11:55:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:55:36,808 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-12-14 11:55:36,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 32 states have internal predecessors, (40), 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 11:55:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-12-14 11:55:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 11:55:36,809 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:55:36,809 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, 1, 1, 1, 1, 1] [2022-12-14 11:55:36,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 11:55:37,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:37,011 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:55:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:55:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1952322923, now seen corresponding path program 1 times [2022-12-14 11:55:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:55:37,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227893093] [2022-12-14 11:55:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:55:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:55:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:55:37,075 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 11:55:37,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:55:37,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227893093] [2022-12-14 11:55:37,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227893093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:55:37,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057833207] [2022-12-14 11:55:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:55:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:55:37,077 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:55:37,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 11:55:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:55:37,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:55:37,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:37,183 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 11:55:37,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 11:55:37,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057833207] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:37,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1222212120] [2022-12-14 11:55:37,230 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-12-14 11:55:37,230 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:55:37,231 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:55:37,231 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:55:37,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:55:37,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:37,485 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:55:37,486 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 11:55:37,501 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 11:55:37,509 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 11:55:37,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:37,521 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 11:55:37,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:37,542 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 11:55:37,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:37,588 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 11:55:38,265 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 11:55:38,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,309 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:55:38,310 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 11:55:38,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,517 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 11:55:38,517 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 11:55:38,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,560 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:55:38,561 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 11:55:38,602 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 11:55:38,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:38,691 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 11:55:40,694 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:55:40,695 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 213 for LOIs [2022-12-14 11:55:40,783 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 11:55:40,874 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 11:55:40,961 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:55:52,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1222212120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:55:52,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:55:52,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 43 [2022-12-14 11:55:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812378581] [2022-12-14 11:55:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:55:52,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 11:55:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:55:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 11:55:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1588, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 11:55:52,976 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 31 states have internal predecessors, (40), 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 11:55:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:55:56,199 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-12-14 11:55:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 11:55:56,200 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 31 states have internal predecessors, (40), 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 72 [2022-12-14 11:55:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:55:56,201 INFO L225 Difference]: With dead ends: 93 [2022-12-14 11:55:56,201 INFO L226 Difference]: Without dead ends: 67 [2022-12-14 11:55:56,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 169 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 11:55:56,202 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:55:56,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 117 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 11:55:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-14 11:55:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-14 11:55:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.0) internal successors, (46), 46 states have internal predecessors, (46), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-12-14 11:55:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-12-14 11:55:56,220 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 72 [2022-12-14 11:55:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:55:56,220 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-12-14 11:55:56,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 31 states have internal predecessors, (40), 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 11:55:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-12-14 11:55:56,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-14 11:55:56,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:55:56,221 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, 1, 1, 1, 1, 1] [2022-12-14 11:55:56,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 11:55:56,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 11:55:56,423 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 11:55:56,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:55:56,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1146190146, now seen corresponding path program 1 times [2022-12-14 11:55:56,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:55:56,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867824087] [2022-12-14 11:55:56,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:55:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:55:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:55:56,534 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 11:55:56,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:55:56,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867824087] [2022-12-14 11:55:56,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867824087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:55:56,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937921560] [2022-12-14 11:55:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:55:56,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:55:56,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:55:56,536 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:55:56,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 11:55:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:55:56,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 11:55:56,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:55:56,632 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 11:55:56,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:55:56,672 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 11:55:56,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937921560] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:55:56,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2051587059] [2022-12-14 11:55:56,674 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-12-14 11:55:56,674 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:55:56,674 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:55:56,674 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:55:56,674 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:55:56,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-12-14 11:55:56,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:56,810 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 11:55:56,810 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 11:55:56,819 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 11:55:56,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:56,905 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 11:55:56,906 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 11:55:56,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,020 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 11:55:57,020 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 11:55:57,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,077 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 11:55:57,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,727 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 11:55:57,727 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 11:55:57,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,876 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 11:55:57,876 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 11:55:57,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:57,909 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 11:55:57,910 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 11:55:57,951 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 11:55:57,959 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 11:55:58,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:55:58,053 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 11:56:00,283 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 28 for LOIs [2022-12-14 11:56:00,284 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-12-14 11:56:00,286 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 192 for LOIs [2022-12-14 11:56:00,361 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 11:56:00,368 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:56:11,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2051587059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:56:11,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:56:11,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 43 [2022-12-14 11:56:11,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425721412] [2022-12-14 11:56:11,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:56:11,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 11:56:11,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:56:11,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 11:56:11,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 11:56:11,729 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 37 states, 28 states have (on average 1.5) internal successors, (42), 32 states have internal predecessors, (42), 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 11:56:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:56:13,718 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-12-14 11:56:13,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 11:56:13,719 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.5) internal successors, (42), 32 states have internal predecessors, (42), 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 74 [2022-12-14 11:56:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:56:13,719 INFO L225 Difference]: With dead ends: 67 [2022-12-14 11:56:13,719 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 11:56:13,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=331, Invalid=1739, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 11:56:13,720 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 11:56:13,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 68 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 11:56:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 11:56:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 11:56:13,720 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 11:56:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 11:56:13,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-12-14 11:56:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:56:13,720 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 11:56:13,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.5) internal successors, (42), 32 states have internal predecessors, (42), 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 11:56:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 11:56:13,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 11:56:13,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 11:56:13,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 11:56:13,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 11:56:13,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 11:56:13,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 11:56:13,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 11:56:13,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 11:56:13,723 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 11:56:13,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 11:56:13,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 11:56:13,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 11:56:28,803 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 539 DAG size of output: 316 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 11:56:35,790 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 546 DAG size of output: 323 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 11:56:45,848 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 546 DAG size of output: 323 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 11:56:59,956 WARN L233 SmtUtils]: Spent 6.70s on a formula simplification. DAG size of input: 543 DAG size of output: 320 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 11:56:59,960 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-14 11:56:59,960 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-14 11:56:59,960 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1514 1517) the Hoare annotation is: true [2022-12-14 11:56:59,960 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-12-14 11:56:59,960 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-14 11:56:59,960 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-14 11:56:59,960 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1610) no Hoare annotation was computed. [2022-12-14 11:56:59,960 INFO L902 garLoopResultBuilder]: At program point L1654(line 1654) the Hoare annotation is: true [2022-12-14 11:56:59,960 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-12-14 11:56:59,960 INFO L899 garLoopResultBuilder]: For program point L1572(lines 1572 1583) no Hoare annotation was computed. [2022-12-14 11:56:59,960 INFO L899 garLoopResultBuilder]: For program point L1572-1(lines 1548 1585) no Hoare annotation was computed. [2022-12-14 11:56:59,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-12-14 11:56:59,961 INFO L899 garLoopResultBuilder]: For program point L1556(lines 1556 1563) no Hoare annotation was computed. [2022-12-14 11:56:59,961 INFO L895 garLoopResultBuilder]: At program point L1581(line 1581) 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) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~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) (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#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 11:56:59,961 INFO L899 garLoopResultBuilder]: For program point L1606(lines 1606 1617) no Hoare annotation was computed. [2022-12-14 11:56:59,961 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-12-14 11:56:59,961 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (let ((.cse46 (store ((as const (Array Int Int)) 0) 0 0))) (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 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= .cse46 (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8))))) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select (select |#memory_int| 6) 0) 0)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (= ~globalArgc~0 0)) (.cse38 (= (select |#valid| 6) 1)) (.cse39 (= (select |#length| 8) 54)) (.cse40 (= 5 ~globalFive~0)) (.cse41 (= (select |#valid| 10) 1)) (.cse42 (= (select |#valid| 8) 1)) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 6)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 5)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 9)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 4)) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5| 3)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_5|) .cse46))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse37 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45)))) [2022-12-14 11:56:59,961 INFO L899 garLoopResultBuilder]: For program point L1590-1(line 1590) no Hoare annotation was computed. [2022-12-14 11:56:59,961 INFO L899 garLoopResultBuilder]: For program point L1590-2(lines 1590 1603) no Hoare annotation was computed. [2022-12-14 11:56:59,962 INFO L895 garLoopResultBuilder]: At program point L1590-4(lines 1590 1603) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= (select |#length| 5) 54)) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select (select |#memory_int| 6) 0) 0)) (.cse30 (= (select |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse32 (= (select |#valid| 2) 1)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~globalFalse~0 0)) (.cse35 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse36 (= ~globalArgc~0 0)) (.cse37 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse43 (store ((as const (Array Int Int)) 0) 0 0)) (.cse38 (= (select |#valid| 6) 1)) (.cse39 (= (select |#length| 8) 54)) (.cse40 (= 5 ~globalFive~0)) (.cse41 (= (select |#valid| 10) 1)) (.cse42 (= (select |#valid| 8) 1)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse43 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse44 .cse45 .cse46) (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 (= .cse43 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .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 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse35 .cse36 .cse37 (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|) .cse43) (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)))) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse38 .cse39 .cse40 .cse41 .cse42 .cse44 .cse45 .cse46))) [2022-12-14 11:56:59,962 INFO L895 garLoopResultBuilder]: At program point L1615(line 1615) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse36 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse37 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse38 (= ~globalArgc~0 0)) (.cse39 (= (select |#valid| 6) 1)) (.cse40 (= (select |#length| 8) 54)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (= (select |#valid| 10) 1)) (.cse43 (= (select |#valid| 8) 1)) (.cse19 (store ((as const (Array Int Int)) 0) 0 0)) (.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 .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 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse36 .cse37 .cse38 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (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 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse19 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse44 .cse45 .cse46))) [2022-12-14 11:56:59,962 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 11:56:59,963 INFO L899 garLoopResultBuilder]: For program point L1574(lines 1574 1582) no Hoare annotation was computed. [2022-12-14 11:56:59,963 INFO L899 garLoopResultBuilder]: For program point L1632(line 1632) no Hoare annotation was computed. [2022-12-14 11:56:59,963 INFO L899 garLoopResultBuilder]: For program point L1632-1(lines 1632 1639) no Hoare annotation was computed. [2022-12-14 11:56:59,963 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-12-14 11:56:59,963 INFO L899 garLoopResultBuilder]: For program point L1566-1(lines 1566 1584) no Hoare annotation was computed. [2022-12-14 11:56:59,964 INFO L895 garLoopResultBuilder]: At program point L1624(line 1624) the Hoare annotation is: (let ((.cse54 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse59 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse14 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse54 (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))))) (.cse23 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse53 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse37 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse51 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse10 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse18 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse52 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse55 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse63 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse54 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse5 (= (select (select |#memory_int| 2) 0) 0)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse7 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse8 (= (select |#valid| 9) 1)) (.cse9 (= (select |#valid| 11) 1)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse15 (= (select |#valid| 3) 1)) (.cse16 (= 21 (select |#length| 4))) (.cse17 (= (select |#valid| 7) 1)) (.cse19 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse20 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse21 (= (select |#length| 10) 18)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#length| 5) 54)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 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 (= ~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)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse57 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse40 (= ~globalFalse~0 0)) (.cse58 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse60 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse41 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse42 (= ~globalArgc~0 0)) (.cse56 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse61 (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|) .cse54) (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))))) (.cse62 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 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 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse51 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse52 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse53 .cse26 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse54) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse36 .cse38 .cse39 .cse40 .cse42 .cse56 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse57 .cse40 .cse58 .cse59 .cse60 .cse42 .cse56 .cse61 .cse62 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 (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|) .cse54) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse24 .cse25 .cse53 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse58 .cse42 .cse56 .cse62 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse59 .cse60 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse51 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse52 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse36 .cse38 .cse39 .cse40 .cse59 .cse60 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse63 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse53 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse42 .cse56 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse51 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse52 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse55 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse63 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse57 .cse40 .cse58 .cse60 .cse41 .cse42 .cse56 .cse61 .cse62 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50)))) [2022-12-14 11:56:59,964 INFO L899 garLoopResultBuilder]: For program point L1624-1(line 1624) no Hoare annotation was computed. [2022-12-14 11:56:59,964 INFO L899 garLoopResultBuilder]: For program point L1624-2(lines 1624 1631) no Hoare annotation was computed. [2022-12-14 11:56:59,965 INFO L895 garLoopResultBuilder]: At program point L1624-3(lines 1624 1631) the Hoare annotation is: (let ((.cse58 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse51 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse47 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse58 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse5 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse17 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse34 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse57 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse53 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse60 (<= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse61 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse62 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse56 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse59 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse63 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.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))) (.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 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse52 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse58 (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)) (.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|)) (.cse54 (<= |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)) (.cse35 (= (select |#length| 1) 1)) (.cse55 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse36 (= (select |#valid| 2) 1)) (.cse37 (= |#NULL.offset| 0)) (.cse38 (= ~globalFalse~0 0)) (.cse39 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.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)) (.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 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse51 .cse11 .cse12 .cse13 .cse52 .cse14 .cse15 .cse16 .cse53 .cse18 .cse19 .cse20 .cse21 .cse54 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse55 .cse36 .cse37 .cse38 .cse56 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse51 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse53 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse56 .cse41 .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 .cse20 .cse21 .cse22 .cse23 .cse57 .cse24 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse58) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse41 .cse59 .cse42 .cse43 .cse44 .cse45 .cse46 .cse48 .cse49 .cse50) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse60 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse35 .cse36 .cse37 .cse38 .cse62 .cse39 .cse40 .cse41 .cse59 (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|) .cse58) (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)))) .cse63 .cse42 .cse43 .cse44 .cse45 .cse46 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .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|) .cse58) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse22 .cse23 .cse57 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse62 .cse41 .cse59 .cse63 .cse42 .cse43 .cse44 .cse45 .cse46 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse52 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse54 .cse22 .cse23 .cse57 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse55 .cse36 .cse37 .cse38 .cse41 .cse59 .cse42 .cse43 .cse44 .cse45 .cse46 .cse48 .cse49 .cse50) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| Int)) (and (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 2)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|) .cse58) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 4)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8| 5)) (= 0 (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_8|)))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse53 .cse60 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse61 .cse35 .cse36 .cse37 .cse38 .cse62 .cse56 .cse41 .cse59 .cse63 .cse42 .cse43 .cse44 .cse45 .cse46 .cse48 .cse49 .cse50) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse52 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse54 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse55 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse48 .cse49 .cse50)))) [2022-12-14 11:56:59,965 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-12-14 11:56:59,965 INFO L899 garLoopResultBuilder]: For program point L1649-1(lines 1649 1656) no Hoare annotation was computed. [2022-12-14 11:56:59,965 INFO L899 garLoopResultBuilder]: For program point L1641(lines 1641 1657) no Hoare annotation was computed. [2022-12-14 11:56:59,965 INFO L899 garLoopResultBuilder]: For program point L1608(lines 1608 1616) no Hoare annotation was computed. [2022-12-14 11:56:59,965 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) 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 (= 16 (select |#length| 7))) (.cse25 (= (select |#length| 5) 54)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 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 (= ~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| |ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base|) 14)) (.cse37 (= (select |#length| 1) 1)) (.cse38 (= (select |#valid| 2) 1)) (.cse39 (= |#NULL.offset| 0)) (.cse40 (= ~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 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse41 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (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 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49))) [2022-12-14 11:56:59,965 INFO L899 garLoopResultBuilder]: For program point L1600-1(lines 1594 1601) no Hoare annotation was computed. [2022-12-14 11:56:59,965 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-12-14 11:56:59,965 INFO L899 garLoopResultBuilder]: For program point L1576-1(line 1576) no Hoare annotation was computed. [2022-12-14 11:56:59,966 INFO L899 garLoopResultBuilder]: For program point L1634(lines 1634 1638) no Hoare annotation was computed. [2022-12-14 11:56:59,966 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-12-14 11:56:59,966 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1636) no Hoare annotation was computed. [2022-12-14 11:56:59,966 INFO L895 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: false [2022-12-14 11:56:59,966 INFO L899 garLoopResultBuilder]: For program point L1651(lines 1651 1655) no Hoare annotation was computed. [2022-12-14 11:56:59,966 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 11:56:59,966 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-12-14 11:56:59,967 INFO L899 garLoopResultBuilder]: For program point L1552-2(lines 1552 1565) no Hoare annotation was computed. [2022-12-14 11:56:59,967 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1565) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~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 11:56:59,967 INFO L899 garLoopResultBuilder]: For program point L1610(line 1610) no Hoare annotation was computed. [2022-12-14 11:56:59,968 INFO L895 garLoopResultBuilder]: At program point L1577(line 1577) 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) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 1073741822) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (exists ((|v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 5)) (= (store ((as const (Array Int Int)) 0) 0 0) (select |#memory_int| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 10)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 0)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 9)) (= (select |#length| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 14) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 6)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base_9| 8)))) (= ~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) (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 1 |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 11:56:59,968 INFO L899 garLoopResultBuilder]: For program point L1610-1(line 1610) no Hoare annotation was computed. [2022-12-14 11:56:59,968 INFO L895 garLoopResultBuilder]: At program point L1668(line 1668) 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 11:56:59,968 INFO L899 garLoopResultBuilder]: For program point L1668-1(line 1668) no Hoare annotation was computed. [2022-12-14 11:56:59,968 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 11:56:59,968 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1636) no Hoare annotation was computed. [2022-12-14 11:56:59,968 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1601) no Hoare annotation was computed. [2022-12-14 11:56:59,969 INFO L899 garLoopResultBuilder]: For program point L1586(lines 1586 1619) no Hoare annotation was computed. [2022-12-14 11:56:59,969 INFO L895 garLoopResultBuilder]: At program point L1611(line 1611) the Hoare annotation is: (let ((.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= (select |#valid| 7) 1)) (.cse15 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse17 (= (select |#length| 10) 18)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse19 (= 16 (select |#length| 7))) (.cse20 (= (select |#length| 5) 54)) (.cse21 (= (select |#valid| 4) 1)) (.cse22 (= 16 (select |#length| 3))) (.cse23 (= (select |#length| 2) 1)) (.cse24 (= (select |#valid| 1) 1)) (.cse25 (= 16 (select |#length| 11))) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse29 (= (select (select |#memory_int| 6) 0) 0)) (.cse30 (= (select |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse32 (= (select |#valid| 2) 1)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~globalFalse~0 0)) (.cse35 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse36 (= ~globalArgc~0 0)) (.cse38 (= (select |#valid| 6) 1)) (.cse39 (= (select |#length| 8) 54)) (.cse40 (= 5 ~globalFive~0)) (.cse41 (= (select |#valid| 10) 1)) (.cse42 (= (select |#valid| 8) 1)) (.cse37 (store ((as const (Array Int Int)) 0) 0 0)) (.cse47 (<= 1 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 1073741822)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|) .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 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) .cse35 .cse36 (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|) .cse37) (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)))) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (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 (= .cse37 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse47 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse37 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)))) .cse47 .cse43 .cse44 .cse45 .cse46))) [2022-12-14 11:56:59,969 INFO L899 garLoopResultBuilder]: For program point L1636(line 1636) no Hoare annotation was computed. [2022-12-14 11:56:59,969 INFO L899 garLoopResultBuilder]: For program point L1636-1(line 1636) no Hoare annotation was computed. [2022-12-14 11:56:59,969 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1610) no Hoare annotation was computed. [2022-12-14 11:56:59,970 INFO L895 garLoopResultBuilder]: At program point L1562(line 1562) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 11:56:59,970 INFO L899 garLoopResultBuilder]: For program point L1562-1(lines 1556 1563) no Hoare annotation was computed. [2022-12-14 11:56:59,970 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-12-14 11:56:59,970 INFO L899 garLoopResultBuilder]: For program point L1620(lines 1620 1640) no Hoare annotation was computed. [2022-12-14 11:56:59,970 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-12-14 11:56:59,971 INFO L895 garLoopResultBuilder]: At program point L1645(line 1645) the Hoare annotation is: (let ((.cse20 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse65 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse40 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse66 (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))))) (.cse43 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse57 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse53 (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))))) (.cse58 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse54 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse55 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse61 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse63 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse64 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse62 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse20 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse56 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse4 (= (select (select |#memory_int| 2) 0) 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#valid| 9) 1)) (.cse8 (= (select |#valid| 11) 1)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse15 (= (select |#valid| 7) 1)) (.cse59 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse21 (= 16 (select |#length| 7))) (.cse22 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse23 (= (select |#length| 5) 54)) (.cse24 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= 16 (select |#length| 3))) (.cse27 (= (select |#length| 2) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse29 (= 16 (select |#length| 11))) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse31 (= ~globalArgv~0.base 0)) (.cse32 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse33 (<= 4 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse34 (= (select (select |#memory_int| 6) 0) 0)) (.cse35 (= (select |#valid| 0) 0)) (.cse60 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse41 (= ~globalArgc~0 0)) (.cse42 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= (select |#length| 8) 54)) (.cse46 (= 5 ~globalFive~0)) (.cse47 (<= |ULTIMATE.start_goodG2B1_~result~2#1| 4)) (.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 (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 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse53 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse54 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse55 .cse37 .cse38 .cse39 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse57 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse58 .cse59 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse60 .cse36 .cse37 .cse38 .cse39 .cse61 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse62 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse53 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse54 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse55 .cse37 .cse38 .cse39 .cse63 .cse64 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 (<= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse63 .cse64 .cse41 .cse42 .cse66 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse64 .cse61 .cse41 .cse42 .cse66 .cse43 .cse44 .cse45 .cse46 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse57 .cse9 .cse10 .cse11 .cse53 .cse12 .cse13 .cse14 .cse15 .cse58 .cse16 .cse17 .cse18 .cse19 .cse54 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse55 .cse37 .cse38 .cse39 .cse61 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse59 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse60 .cse36 .cse37 .cse38 .cse39 .cse63 .cse64 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse62 .cse50 .cse51 .cse52) (and .cse0 .cse1 .cse2 .cse3 .cse56 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse59 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse20) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse60 .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52)))) [2022-12-14 11:56:59,971 INFO L899 garLoopResultBuilder]: For program point L1645-1(line 1645) no Hoare annotation was computed. [2022-12-14 11:56:59,972 INFO L895 garLoopResultBuilder]: At program point L1645-4(lines 1645 1648) the Hoare annotation is: (let ((.cse56 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse4 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse19 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse37 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse51 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse56 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.cse58 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse59 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse66 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse60 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse61 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse56) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse62 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse10 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse18 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse43 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 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)) (.cse11 (= (select (select |#memory_int| 1) 0) 0)) (.cse12 (= ~globalArgv~0.offset 0)) (.cse13 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse63 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse56 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse14 (= (select |#valid| 3) 1)) (.cse15 (= 21 (select |#length| 4))) (.cse16 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse17 (= (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|)) (.cse64 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#length| 5) 54)) (.cse55 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= 16 (select |#length| 3))) (.cse28 (= (select |#length| 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 (= ~globalArgv~0.base 0)) (.cse33 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse34 (<= 4 |ULTIMATE.start_goodG2B1_~result~2#1|)) (.cse35 (= (select (select |#memory_int| 6) 0) 0)) (.cse36 (= (select |#valid| 0) 0)) (.cse38 (= (select |#length| 1) 1)) (.cse65 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse42 (= |ULTIMATE.start_goodG2B2_~data~3#1| 2)) (.cse44 (= ~globalArgc~0 0)) (.cse57 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse45 (= (select |#valid| 6) 1)) (.cse46 (= (select |#length| 8) 54)) (.cse47 (= 5 ~globalFive~0)) (.cse48 (<= |ULTIMATE.start_goodG2B1_~result~2#1| 4)) (.cse49 (= (select |#valid| 10) 1)) (.cse50 (= (select |#valid| 8) 1)) (.cse52 (< 0 |#StackHeapBarrier|)) (.cse53 (= |#NULL.base| 0)) (.cse54 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse55 .cse26 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse56) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse44 .cse57 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse38 .cse39 .cse40 .cse41 .cse59 .cse60 .cse42 .cse43 .cse44 .cse57 .cse61 .cse62 .cse45 .cse46 .cse47 .cse49 .cse50 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22 .cse23 .cse64 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse65 .cse39 .cse40 .cse41 .cse66 .cse60 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse66 .cse60 .cse42 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22 .cse23 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 0)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 6)) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 3)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5|) .cse56) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse24 .cse25 .cse55 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse41 .cse59 .cse42 .cse44 .cse57 .cse62 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 (<= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse58 .cse38 .cse39 .cse40 .cse41 .cse59 .cse66 .cse60 .cse42 .cse44 .cse57 .cse61 .cse62 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse64 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse65 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse52 .cse53 .cse54) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse63 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21 .cse22 .cse23 .cse64 .cse24 .cse25 .cse55 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse65 .cse39 .cse40 .cse41 .cse42 .cse44 .cse57 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse52 .cse53 .cse54)))) [2022-12-14 11:56:59,972 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-12-14 11:56:59,972 INFO L902 garLoopResultBuilder]: At program point L1670(line 1670) the Hoare annotation is: true [2022-12-14 11:56:59,973 INFO L895 garLoopResultBuilder]: At program point L1637(line 1637) the Hoare annotation is: (let ((.cse53 (store ((as const (Array Int Int)) 0) 0 0))) (let ((.cse38 (<= 1073741823 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse32 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 2)) (.cse37 (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) (.cse39 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 5)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) .cse53) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 10)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 11)) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 0)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 9)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_6| 4))))) (.cse43 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 0)) (.cse54 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse41 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) (.cse59 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| Int)) (and (= .cse53 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 8)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 6)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 0)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 9)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_7| 10))))) (.cse60 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse61 (<= 1073741823 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse52 (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|)) (.cse0 (= (select |#length| 9) 21)) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= (select |#length| 6) 1)) (.cse3 (= 1 (select |#valid| 5))) (.cse55 (< 0 |ULTIMATE.start_goodB2G1_~data~0#1|)) (.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)) (.cse63 (< 0 |ULTIMATE.start_goodB2G2_~data~1#1|)) (.cse9 (= (select (select |#memory_int| 1) 0) 0)) (.cse10 (= ~globalArgv~0.offset 0)) (.cse11 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse12 (= (select |#valid| 3) 1)) (.cse13 (= 21 (select |#length| 4))) (.cse14 (= |ULTIMATE.start_goodG2B1_~result~2#1| (* 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse15 (= (select |#valid| 7) 1)) (.cse64 (< |ULTIMATE.start_goodB2G2_~data~1#1| 1073741823)) (.cse56 (< |ULTIMATE.start_goodB2G1_~data~0#1| 1073741823)) (.cse16 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse17 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse18 (= (select |#length| 10) 18)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (= 16 (select |#length| 7))) (.cse21 (= (select |#length| 5) 54)) (.cse22 (= (select |#valid| 4) 1)) (.cse23 (= 16 (select |#length| 3))) (.cse24 (= (select |#length| 2) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= 16 (select |#length| 11))) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select (select |#memory_int| 6) 0) 0)) (.cse31 (= (select |#valid| 0) 0)) (.cse57 (= |ULTIMATE.start_goodB2G1_~result~0#1| (* 2 |ULTIMATE.start_goodB2G1_~data~0#1|))) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse62 (= |ULTIMATE.start_goodB2G2_~result~1#1| (* |ULTIMATE.start_goodB2G2_~data~1#1| 2))) (.cse40 (= ~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)) (.cse58 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 10)) (not (= 3 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (= .cse53 (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|) 0) (not (= 2 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 0)) (not (= 5 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 8 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 11)) (= 14 (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12| 4)) (not (= 6 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|)) (not (= 9 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_12|))))) (.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 (<= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) .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 .cse52 .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|) .cse53) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_5| 10)))) .cse20 .cse21 .cse54 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse40 .cse41 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse56 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse57 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse44 .cse45 .cse46 .cse47 .cse48 .cse58 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse59 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse60 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse61 .cse34 .cse35 .cse36 .cse38 .cse39 .cse40 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .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 .cse39 .cse62 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse56 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse54 .cse22 (exists ((|v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| Int)) (and (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 5)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 9)) (not (= 7 |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 2)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 3)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 10)) (= (select |#memory_int| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) .cse53) (= (select |#length| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 14) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 8)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 4)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 6)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) (= (select |#valid| |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9|) 0) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 11)) (not (= |v_ULTIMATE.start_goodB2G2_~#inputBuffer~1#1.base_9| 0)))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse57 .cse33 .cse34 .cse35 .cse36 .cse40 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse59 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse60 .cse20 .cse21 .cse54 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse61 .cse34 .cse35 .cse36 .cse40 .cse41 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse59 .cse12 .cse13 .cse14 .cse15 .cse64 .cse16 .cse17 .cse18 .cse19 .cse60 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse61 .cse34 .cse35 .cse36 .cse62 .cse40 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51) (and .cse52 .cse0 .cse1 .cse2 .cse3 .cse55 .cse4 .cse5 .cse6 .cse7 .cse8 .cse63 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse64 .cse56 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse57 .cse33 .cse34 .cse35 .cse36 .cse62 .cse40 .cse44 .cse45 .cse46 .cse47 .cse48 .cse58 .cse49 .cse50 .cse51)))) [2022-12-14 11:56:59,973 INFO L902 garLoopResultBuilder]: At program point L1670-1(line 1670) the Hoare annotation is: true [2022-12-14 11:56:59,973 INFO L899 garLoopResultBuilder]: For program point L1604(line 1604) no Hoare annotation was computed. [2022-12-14 11:56:59,974 INFO L899 garLoopResultBuilder]: For program point L1604-1(lines 1604 1618) no Hoare annotation was computed. [2022-12-14 11:56:59,974 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1510 1513) the Hoare annotation is: true [2022-12-14 11:56:59,974 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-12-14 11:56:59,977 INFO L445 BasicCegarLoop]: Path program histogram: [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 11:56:59,978 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:56:59,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:56:59 BoogieIcfgContainer [2022-12-14 11:56:59,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:56:59,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:56:59,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:56:59,984 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:56:59,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:52:52" (3/4) ... [2022-12-14 11:56:59,986 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 11:56:59,990 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-14 11:56:59,990 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-12-14 11:56:59,990 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-14 11:56:59,991 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-12-14 11:56:59,995 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-12-14 11:56:59,995 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-14 11:56:59,995 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 11:56:59,995 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 11:56:59,995 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 11:57:00,035 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 11:57:00,036 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:57:00,036 INFO L158 Benchmark]: Toolchain (without parser) took 248350.36ms. Allocated memory was 115.3MB in the beginning and 297.8MB in the end (delta: 182.5MB). Free memory was 77.0MB in the beginning and 58.6MB in the end (delta: 18.4MB). Peak memory consumption was 205.0MB. Max. memory is 16.1GB. [2022-12-14 11:57:00,036 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:57:00,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.08ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 76.7MB in the beginning and 74.0MB in the end (delta: 2.7MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2022-12-14 11:57:00,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.66ms. Allocated memory is still 140.5MB. Free memory was 74.0MB in the beginning and 71.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 11:57:00,037 INFO L158 Benchmark]: Boogie Preprocessor took 18.68ms. Allocated memory is still 140.5MB. Free memory was 71.1MB in the beginning and 69.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:57:00,037 INFO L158 Benchmark]: RCFGBuilder took 375.20ms. Allocated memory is still 140.5MB. Free memory was 69.0MB in the beginning and 97.2MB in the end (delta: -28.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 11:57:00,037 INFO L158 Benchmark]: TraceAbstraction took 247098.01ms. Allocated memory was 140.5MB in the beginning and 297.8MB in the end (delta: 157.3MB). Free memory was 96.3MB in the beginning and 62.8MB in the end (delta: 33.5MB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. [2022-12-14 11:57:00,037 INFO L158 Benchmark]: Witness Printer took 51.67ms. Allocated memory is still 297.8MB. Free memory was 62.8MB in the beginning and 58.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 11:57:00,038 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 115.3MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.08ms. Allocated memory was 115.3MB in the beginning and 140.5MB in the end (delta: 25.2MB). Free memory was 76.7MB in the beginning and 74.0MB in the end (delta: 2.7MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.66ms. Allocated memory is still 140.5MB. Free memory was 74.0MB in the beginning and 71.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.68ms. Allocated memory is still 140.5MB. Free memory was 71.1MB in the beginning and 69.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.20ms. Allocated memory is still 140.5MB. Free memory was 69.0MB in the beginning and 97.2MB in the end (delta: -28.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 247098.01ms. Allocated memory was 140.5MB in the beginning and 297.8MB in the end (delta: 157.3MB). Free memory was 96.3MB in the beginning and 62.8MB in the end (delta: 33.5MB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. * Witness Printer took 51.67ms. Allocated memory is still 297.8MB. Free memory was 62.8MB in the beginning and 58.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1610]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: 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, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 247.0s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 71.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1313 SdHoareTripleChecker+Valid, 27.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1143 mSDsluCounter, 5403 SdHoareTripleChecker+Invalid, 25.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3640 mSDsCounter, 503 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15239 IncrementalHoareTripleChecker+Invalid, 15742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 503 mSolverCounterUnsat, 1763 mSDtfsCounter, 15239 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2426 GetRequests, 1817 SyntacticMatches, 71 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8426 ImplicationChecksByTransitivity, 132.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=17, InterpolantAutomatonStates: 478, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 293 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 210 PreInvPairs, 321 NumberOfFragments, 18237 HoareAnnotationTreeSize, 210 FomulaSimplifications, 2603 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 25 FomulaSimplificationsInter, 84139 FormulaSimplificationTreeSizeReductionInter, 43.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2180 NumberOfCodeBlocks, 2180 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2749 ConstructedInterpolants, 0 QuantifiedInterpolants, 3446 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4456 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 49 InterpolantComputations, 14 PerfectInterpolantSequences, 1303/1350 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: 32.2s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 45, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 552, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 384, TOOLS_POST_TIME: 15.0s, TOOLS_POST_CALL_APPLICATIONS: 306, TOOLS_POST_CALL_TIME: 7.7s, TOOLS_POST_RETURN_APPLICATIONS: 204, TOOLS_POST_RETURN_TIME: 5.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 894, TOOLS_QUANTIFIERELIM_TIME: 27.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 1302, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 270, DOMAIN_JOIN_TIME: 2.6s, 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: 552, DOMAIN_ISBOTTOM_TIME: 1.1s, 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: 204, CALL_SUMMARIZER_CACHE_MISSES: 36, 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: 18262, DAG_COMPRESSION_RETAINED_NODES: 1329, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1670]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 11:57:00,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38fbcf61-a531-4ba7-8b96-c1151e2aed0e/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE