./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_08_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/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_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_08_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/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_abf5b7c6-ef38-454f-a785-196c6ecd8150/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 ebc8d70dd3a6dd092ec9912a17d9918c446a44f9f568e0b66fefb63ce5d792d1 --- 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 15:10:38,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:10:38,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:10:38,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:10:38,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:10:38,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:10:38,325 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:10:38,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:10:38,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:10:38,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:10:38,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:10:38,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:10:38,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:10:38,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:10:38,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:10:38,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:10:38,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:10:38,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:10:38,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:10:38,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:10:38,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:10:38,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:10:38,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:10:38,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:10:38,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:10:38,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:10:38,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:10:38,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:10:38,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:10:38,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:10:38,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:10:38,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:10:38,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:10:38,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:10:38,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:10:38,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:10:38,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:10:38,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:10:38,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:10:38,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:10:38,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:10:38,347 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 15:10:38,363 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:10:38,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:10:38,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:10:38,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:10:38,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:10:38,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:10:38,364 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:10:38,364 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:10:38,364 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:10:38,364 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:10:38,365 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:10:38,365 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:10:38,365 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:10:38,365 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:10:38,365 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:10:38,365 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:10:38,365 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:10:38,365 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:10:38,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:10:38,366 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:10:38,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:10:38,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:10:38,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:10:38,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:10:38,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:10:38,367 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 15:10:38,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:10:38,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:10:38,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:10:38,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:10:38,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:10:38,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:10:38,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:10:38,368 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:10:38,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:10:38,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:10:38,368 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:10:38,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:10:38,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:10:38,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:10:38,369 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_abf5b7c6-ef38-454f-a785-196c6ecd8150/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_abf5b7c6-ef38-454f-a785-196c6ecd8150/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 -> ebc8d70dd3a6dd092ec9912a17d9918c446a44f9f568e0b66fefb63ce5d792d1 [2022-12-14 15:10:38,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:10:38,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:10:38,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:10:38,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:10:38,576 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:10:38,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_08_good.i [2022-12-14 15:10:41,197 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:10:41,423 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:10:41,424 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fgets_multiply_08_good.i [2022-12-14 15:10:41,441 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/data/3c8294225/f54da8443a964479ba5b1a07d42e6717/FLAG42ae623fc [2022-12-14 15:10:41,455 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/data/3c8294225/f54da8443a964479ba5b1a07d42e6717 [2022-12-14 15:10:41,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:10:41,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:10:41,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:10:41,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:10:41,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:10:41,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:10:41" (1/1) ... [2022-12-14 15:10:41,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d256dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:41, skipping insertion in model container [2022-12-14 15:10:41,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:10:41" (1/1) ... [2022-12-14 15:10:41,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:10:41,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:10:41,763 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 15:10:42,060 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 15:10:42,064 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 15:10:42,065 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 15:10:42,067 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 15:10:42,068 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 15:10:42,086 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 15:10:42,091 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 15:10:42,098 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 15:10:42,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:10:42,106 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:10:42,121 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 15:10:42,196 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 15:10:42,197 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 15:10:42,197 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 15:10:42,199 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 15:10:42,199 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 15:10:42,202 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 15:10:42,205 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-12-14 15:10:42,207 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 15:10:42,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:10:42,277 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:10:42,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42 WrapperNode [2022-12-14 15:10:42,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:10:42,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:10:42,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:10:42,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:10:42,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,299 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,316 INFO L138 Inliner]: procedures = 506, calls = 93, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 143 [2022-12-14 15:10:42,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:10:42,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:10:42,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:10:42,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:10:42,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,334 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:10:42,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:10:42,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:10:42,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:10:42,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (1/1) ... [2022-12-14 15:10:42,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:10:42,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:42,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:10:42,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:10:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-14 15:10:42,387 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-14 15:10:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-12-14 15:10:42,387 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-14 15:10:42,388 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:10:42,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2022-12-14 15:10:42,388 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2022-12-14 15:10:42,388 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-14 15:10:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:10:42,493 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:10:42,495 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:10:42,665 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:10:42,694 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:10:42,694 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 15:10:42,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:10:42 BoogieIcfgContainer [2022-12-14 15:10:42,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:10:42,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:10:42,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:10:42,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:10:42,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:10:41" (1/3) ... [2022-12-14 15:10:42,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8dbf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:10:42, skipping insertion in model container [2022-12-14 15:10:42,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:10:42" (2/3) ... [2022-12-14 15:10:42,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8dbf52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:10:42, skipping insertion in model container [2022-12-14 15:10:42,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:10:42" (3/3) ... [2022-12-14 15:10:42,704 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fgets_multiply_08_good.i [2022-12-14 15:10:42,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:10:42,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 15:10:42,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:10:42,765 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;@4e6de941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:10:42,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 15:10:42,768 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 15:10:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:10:42,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:42,774 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 15:10:42,774 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 15:10:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1213796289, now seen corresponding path program 1 times [2022-12-14 15:10:42,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:42,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899773386] [2022-12-14 15:10:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:42,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:42,988 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 15:10:42,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:42,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899773386] [2022-12-14 15:10:42,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899773386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:42,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:10:42,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:10:42,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958072276] [2022-12-14 15:10:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:42,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:10:42,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:10:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:10:43,021 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 15:10:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:43,091 INFO L93 Difference]: Finished difference Result 145 states and 200 transitions. [2022-12-14 15:10:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:10:43,093 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 15:10:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:43,099 INFO L225 Difference]: With dead ends: 145 [2022-12-14 15:10:43,099 INFO L226 Difference]: Without dead ends: 72 [2022-12-14 15:10:43,101 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 15:10:43,103 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 15:10:43,104 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 15:10:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-14 15:10:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-12-14 15:10:43,131 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 15:10:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2022-12-14 15:10:43,133 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 18 [2022-12-14 15:10:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:43,134 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2022-12-14 15:10:43,134 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 15:10:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2022-12-14 15:10:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:10:43,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:43,136 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 15:10:43,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:10:43,136 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 15:10:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1718655748, now seen corresponding path program 1 times [2022-12-14 15:10:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:43,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854253621] [2022-12-14 15:10:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:43,220 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 15:10:43,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:43,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854253621] [2022-12-14 15:10:43,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854253621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:43,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:10:43,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:10:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242968987] [2022-12-14 15:10:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:43,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:10:43,223 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 15:10:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:43,254 INFO L93 Difference]: Finished difference Result 115 states and 158 transitions. [2022-12-14 15:10:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:43,255 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 15:10:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:43,256 INFO L225 Difference]: With dead ends: 115 [2022-12-14 15:10:43,256 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 15:10:43,256 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 15:10:43,257 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 15:10:43,257 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 15:10:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 15:10:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2022-12-14 15:10:43,264 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 15:10:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-12-14 15:10:43,265 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 20 [2022-12-14 15:10:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:43,266 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-12-14 15:10:43,266 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 15:10:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-12-14 15:10:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 15:10:43,266 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:43,266 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 15:10:43,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:10:43,267 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 15:10:43,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:43,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1738720556, now seen corresponding path program 1 times [2022-12-14 15:10:43,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:43,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670206203] [2022-12-14 15:10:43,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:43,310 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 15:10:43,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:43,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670206203] [2022-12-14 15:10:43,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670206203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:43,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:10:43,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:10:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359413822] [2022-12-14 15:10:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:43,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:43,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:10:43,312 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 15:10:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:43,354 INFO L93 Difference]: Finished difference Result 173 states and 236 transitions. [2022-12-14 15:10:43,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:43,355 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 15:10:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:43,357 INFO L225 Difference]: With dead ends: 173 [2022-12-14 15:10:43,357 INFO L226 Difference]: Without dead ends: 120 [2022-12-14 15:10:43,357 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 15:10:43,358 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 15:10:43,358 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 15:10:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-14 15:10:43,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 76. [2022-12-14 15:10:43,365 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 15:10:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2022-12-14 15:10:43,366 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 21 [2022-12-14 15:10:43,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:43,366 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2022-12-14 15:10:43,367 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 15:10:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2022-12-14 15:10:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 15:10:43,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:43,367 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 15:10:43,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:10:43,368 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 15:10:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash -134839580, now seen corresponding path program 1 times [2022-12-14 15:10:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:43,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981117713] [2022-12-14 15:10:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:43,427 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 15:10:43,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:43,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981117713] [2022-12-14 15:10:43,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981117713] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:43,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499554192] [2022-12-14 15:10:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:43,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:43,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:43,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:43,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:10:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:43,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:10:43,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:43,547 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 15:10:43,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:10:43,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499554192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:43,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:10:43,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 15:10:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351766697] [2022-12-14 15:10:43,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:43,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:43,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:10:43,549 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 15:10:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:43,577 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2022-12-14 15:10:43,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:43,578 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 15:10:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:43,578 INFO L225 Difference]: With dead ends: 146 [2022-12-14 15:10:43,578 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 15:10:43,579 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 15:10:43,579 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 15:10:43,580 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 15:10:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 15:10:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2022-12-14 15:10:43,585 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 15:10:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2022-12-14 15:10:43,586 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 32 [2022-12-14 15:10:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:43,586 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2022-12-14 15:10:43,587 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 15:10:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-12-14 15:10:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 15:10:43,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:43,587 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 15:10:43,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:10:43,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:43,790 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 15:10:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash 7536895, now seen corresponding path program 1 times [2022-12-14 15:10:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039628315] [2022-12-14 15:10:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:43,938 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 15:10:43,938 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:43,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039628315] [2022-12-14 15:10:43,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039628315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:43,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:10:43,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:10:43,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770613218] [2022-12-14 15:10:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:43,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:43,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:10:43,941 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 15:10:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:43,973 INFO L93 Difference]: Finished difference Result 106 states and 144 transitions. [2022-12-14 15:10:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:43,974 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 15:10:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:43,975 INFO L225 Difference]: With dead ends: 106 [2022-12-14 15:10:43,976 INFO L226 Difference]: Without dead ends: 105 [2022-12-14 15:10:43,976 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 15:10:43,976 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 15:10:43,977 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 15:10:43,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-14 15:10:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2022-12-14 15:10:43,982 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 15:10:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-12-14 15:10:43,983 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 34 [2022-12-14 15:10:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:43,983 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-12-14 15:10:43,983 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 15:10:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-12-14 15:10:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 15:10:43,984 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:43,984 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 15:10:43,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:10:43,984 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 15:10:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 233643865, now seen corresponding path program 1 times [2022-12-14 15:10:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:43,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400919359] [2022-12-14 15:10:43,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:44,035 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 15:10:44,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:44,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400919359] [2022-12-14 15:10:44,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400919359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:44,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:10:44,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:10:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254409487] [2022-12-14 15:10:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:44,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:44,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:44,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:10:44,037 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 15:10:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:44,060 INFO L93 Difference]: Finished difference Result 105 states and 143 transitions. [2022-12-14 15:10:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:44,060 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 15:10:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:44,062 INFO L225 Difference]: With dead ends: 105 [2022-12-14 15:10:44,062 INFO L226 Difference]: Without dead ends: 104 [2022-12-14 15:10:44,062 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 15:10:44,063 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 15:10:44,064 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 15:10:44,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-14 15:10:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-12-14 15:10:44,069 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 15:10:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-12-14 15:10:44,070 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 35 [2022-12-14 15:10:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:44,070 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-12-14 15:10:44,070 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 15:10:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-12-14 15:10:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 15:10:44,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:44,071 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 15:10:44,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:10:44,071 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 15:10:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1168894102, now seen corresponding path program 1 times [2022-12-14 15:10:44,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:44,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247175290] [2022-12-14 15:10:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:44,127 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 15:10:44,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:44,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247175290] [2022-12-14 15:10:44,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247175290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:44,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502761939] [2022-12-14 15:10:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:44,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:44,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:44,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:44,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:10:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:44,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:10:44,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:44,223 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 15:10:44,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:10:44,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502761939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:44,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:10:44,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 15:10:44,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429658086] [2022-12-14 15:10:44,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:44,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:44,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:10:44,225 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 15:10:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:44,250 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2022-12-14 15:10:44,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:44,251 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 15:10:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:44,252 INFO L225 Difference]: With dead ends: 111 [2022-12-14 15:10:44,252 INFO L226 Difference]: Without dead ends: 97 [2022-12-14 15:10:44,252 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 15:10:44,253 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 15:10:44,253 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 15:10:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-14 15:10:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2022-12-14 15:10:44,258 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 15:10:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-12-14 15:10:44,258 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 42 [2022-12-14 15:10:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:44,259 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-12-14 15:10:44,259 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 15:10:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-12-14 15:10:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 15:10:44,260 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:44,261 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 15:10:44,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:10:44,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:44,462 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 15:10:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1875978641, now seen corresponding path program 1 times [2022-12-14 15:10:44,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:44,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801598847] [2022-12-14 15:10:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:44,521 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 15:10:44,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:44,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801598847] [2022-12-14 15:10:44,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801598847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:44,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151645518] [2022-12-14 15:10:44,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:44,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:44,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:44,523 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:44,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:10:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:44,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:10:44,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:44,603 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 15:10:44,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:10:44,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151645518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:44,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:10:44,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 15:10:44,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579443046] [2022-12-14 15:10:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:44,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:44,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:44,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:10:44,605 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 15:10:44,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:44,623 INFO L93 Difference]: Finished difference Result 84 states and 116 transitions. [2022-12-14 15:10:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:44,624 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 15:10:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:44,624 INFO L225 Difference]: With dead ends: 84 [2022-12-14 15:10:44,625 INFO L226 Difference]: Without dead ends: 83 [2022-12-14 15:10:44,625 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 15:10:44,625 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 15:10:44,625 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 15:10:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-14 15:10:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-12-14 15:10:44,630 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 15:10:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2022-12-14 15:10:44,631 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 43 [2022-12-14 15:10:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:44,631 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2022-12-14 15:10:44,631 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 15:10:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2022-12-14 15:10:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 15:10:44,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:44,632 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 15:10:44,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 15:10:44,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:44,833 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 15:10:44,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash -659810818, now seen corresponding path program 1 times [2022-12-14 15:10:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:44,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086898374] [2022-12-14 15:10:44,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:44,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:44,981 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 15:10:44,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:44,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086898374] [2022-12-14 15:10:44,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086898374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:44,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444987251] [2022-12-14 15:10:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:44,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:44,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:44,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:44,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:10:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:45,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:10:45,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:45,079 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 15:10:45,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:10:45,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444987251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:45,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:10:45,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 15:10:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461791103] [2022-12-14 15:10:45,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:45,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:45,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:45,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:10:45,081 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 15:10:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:45,100 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-12-14 15:10:45,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:45,101 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 15:10:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:45,102 INFO L225 Difference]: With dead ends: 111 [2022-12-14 15:10:45,102 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 15:10:45,102 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 15:10:45,103 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 15:10:45,103 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 15:10:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 15:10:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2022-12-14 15:10:45,109 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 15:10:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-12-14 15:10:45,110 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 45 [2022-12-14 15:10:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:45,111 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-12-14 15:10:45,111 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 15:10:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-12-14 15:10:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 15:10:45,112 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:45,112 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 15:10:45,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:10:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:45,314 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 15:10:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1416369249, now seen corresponding path program 1 times [2022-12-14 15:10:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:45,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984082760] [2022-12-14 15:10:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:45,489 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 15:10:45,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984082760] [2022-12-14 15:10:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984082760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903142334] [2022-12-14 15:10:45,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:45,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:45,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:45,491 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:45,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:10:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:45,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 15:10:45,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:45,572 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 15:10:45,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:10:45,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903142334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:45,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:10:45,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-14 15:10:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266761124] [2022-12-14 15:10:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:45,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:10:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:10:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:10:45,574 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 15:10:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:45,589 INFO L93 Difference]: Finished difference Result 81 states and 112 transitions. [2022-12-14 15:10:45,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:10:45,589 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 15:10:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:45,590 INFO L225 Difference]: With dead ends: 81 [2022-12-14 15:10:45,590 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 15:10:45,590 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 15:10:45,591 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 15:10:45,591 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 15:10:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 15:10:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 15:10:45,597 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 15:10:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 111 transitions. [2022-12-14 15:10:45,597 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 111 transitions. Word has length 52 [2022-12-14 15:10:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:45,598 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 111 transitions. [2022-12-14 15:10:45,598 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 15:10:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 111 transitions. [2022-12-14 15:10:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 15:10:45,599 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:45,599 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 15:10:45,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 15:10:45,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:45,800 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 15:10:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash -957773578, now seen corresponding path program 1 times [2022-12-14 15:10:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:45,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296152770] [2022-12-14 15:10:45,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:45,863 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 15:10:45,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:45,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296152770] [2022-12-14 15:10:45,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296152770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:45,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303791290] [2022-12-14 15:10:45,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:45,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:45,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:45,865 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:45,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:10:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:45,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:10:45,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:45,955 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 15:10:45,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:10:45,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303791290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:45,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:10:45,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 15:10:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322390918] [2022-12-14 15:10:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:45,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:10:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:45,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:10:45,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:10:45,957 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 15:10:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:45,986 INFO L93 Difference]: Finished difference Result 118 states and 156 transitions. [2022-12-14 15:10:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:10:45,987 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 15:10:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:45,988 INFO L225 Difference]: With dead ends: 118 [2022-12-14 15:10:45,988 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 15:10:45,988 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 15:10:45,989 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 15:10:45,989 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 15:10:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 15:10:45,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 15:10:45,994 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 15:10:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2022-12-14 15:10:45,995 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 53 [2022-12-14 15:10:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:45,996 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2022-12-14 15:10:45,996 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 15:10:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2022-12-14 15:10:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 15:10:45,997 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:45,997 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 15:10:46,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:10:46,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 15:10:46,199 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 15:10:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 635599291, now seen corresponding path program 1 times [2022-12-14 15:10:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:46,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632055021] [2022-12-14 15:10:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:46,353 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 15:10:46,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:46,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632055021] [2022-12-14 15:10:46,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632055021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:46,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885071121] [2022-12-14 15:10:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:46,355 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:46,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:10:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:46,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:10:46,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:46,457 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 15:10:46,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:10:46,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885071121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:46,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:10:46,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 15:10:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81585635] [2022-12-14 15:10:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:46,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:10:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:46,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:10:46,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:10:46,459 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 15:10:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:46,482 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2022-12-14 15:10:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:10:46,483 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 15:10:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:46,484 INFO L225 Difference]: With dead ends: 114 [2022-12-14 15:10:46,484 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 15:10:46,486 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 15:10:46,487 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 15:10:46,487 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 15:10:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 15:10:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 15:10:46,490 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 15:10:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 108 transitions. [2022-12-14 15:10:46,491 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 108 transitions. Word has length 55 [2022-12-14 15:10:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:46,491 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 108 transitions. [2022-12-14 15:10:46,491 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 15:10:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 108 transitions. [2022-12-14 15:10:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 15:10:46,492 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:46,492 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 15:10:46,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 15:10:46,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 15:10:46,693 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 15:10:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1895142718, now seen corresponding path program 1 times [2022-12-14 15:10:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:46,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452836092] [2022-12-14 15:10:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:46,757 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 15:10:46,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:46,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452836092] [2022-12-14 15:10:46,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452836092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:46,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267163147] [2022-12-14 15:10:46,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:46,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:46,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:46,759 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:46,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:10:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:46,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:10:46,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:46,869 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 15:10:46,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:10:46,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267163147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:46,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:10:46,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 15:10:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074596052] [2022-12-14 15:10:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:46,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:10:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:46,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:10:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:10:46,871 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 15:10:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:46,899 INFO L93 Difference]: Finished difference Result 92 states and 120 transitions. [2022-12-14 15:10:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:10:46,900 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 15:10:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:46,900 INFO L225 Difference]: With dead ends: 92 [2022-12-14 15:10:46,901 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 15:10:46,901 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 15:10:46,902 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 15:10:46,902 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 15:10:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 15:10:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-12-14 15:10:46,908 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 15:10:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2022-12-14 15:10:46,909 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 56 [2022-12-14 15:10:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:46,909 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2022-12-14 15:10:46,909 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 15:10:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2022-12-14 15:10:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 15:10:46,911 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:46,911 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 15:10:46,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 15:10:47,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:47,113 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 15:10:47,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -952828877, now seen corresponding path program 1 times [2022-12-14 15:10:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:47,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556943511] [2022-12-14 15:10:47,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:47,277 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 15:10:47,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:47,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556943511] [2022-12-14 15:10:47,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556943511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:47,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:10:47,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:10:47,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916965472] [2022-12-14 15:10:47,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:47,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:10:47,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:47,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:10:47,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:10:47,280 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 15:10:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:10:47,302 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-12-14 15:10:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:10:47,303 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 15:10:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:10:47,303 INFO L225 Difference]: With dead ends: 94 [2022-12-14 15:10:47,304 INFO L226 Difference]: Without dead ends: 75 [2022-12-14 15:10:47,304 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 15:10:47,305 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 15:10:47,305 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 15:10:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-14 15:10:47,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-12-14 15:10:47,310 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 15:10:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2022-12-14 15:10:47,311 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 60 [2022-12-14 15:10:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:10:47,311 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2022-12-14 15:10:47,311 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 15:10:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2022-12-14 15:10:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 15:10:47,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:10:47,313 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 15:10:47,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 15:10:47,313 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 15:10:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:10:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash -558875546, now seen corresponding path program 1 times [2022-12-14 15:10:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:10:47,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917884162] [2022-12-14 15:10:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:10:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:47,404 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 15:10:47,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:10:47,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917884162] [2022-12-14 15:10:47,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917884162] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:10:47,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155395310] [2022-12-14 15:10:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:10:47,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:10:47,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:10:47,406 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:10:47,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 15:10:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:10:47,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:10:47,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:10:47,522 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 15:10:47,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:10:47,600 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 15:10:47,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155395310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:10:47,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [403777425] [2022-12-14 15:10:47,616 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-12-14 15:10:47,616 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:10:47,619 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:10:47,623 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:10:47,623 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:10:47,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:47,971 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 15:10:47,972 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 15:10:47,997 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 15:10:48,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:48,030 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 15:10:48,030 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 15:10:48,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:48,188 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:10:48,189 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 15:10:48,219 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 15:10:48,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:48,293 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 15:10:48,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:48,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:48,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:48,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:48,912 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:10:48,912 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 15:10:48,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:48,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:49,101 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 15:10:49,102 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 15:10:49,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:49,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:49,149 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:10:49,149 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 15:10:49,205 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 15:10:49,216 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 15:10:49,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:10:49,308 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 15:10:51,008 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:10:51,010 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-12-14 15:10:51,029 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 15:10:51,104 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 15:10:51,111 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:10:59,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [403777425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:10:59,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:10:59,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-12-14 15:10:59,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766102958] [2022-12-14 15:10:59,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:10:59,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 15:10:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:10:59,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 15:10:59,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 15:10:59,039 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 15:11:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:11:16,445 INFO L93 Difference]: Finished difference Result 304 states and 377 transitions. [2022-12-14 15:11:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-14 15:11:16,446 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 15:11:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:11:16,447 INFO L225 Difference]: With dead ends: 304 [2022-12-14 15:11:16,447 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 15:11:16,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=893, Invalid=5427, Unknown=0, NotChecked=0, Total=6320 [2022-12-14 15:11:16,449 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 171 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:11:16,449 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.4s Time] [2022-12-14 15:11:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 15:11:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 113. [2022-12-14 15:11:16,466 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 15:11:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2022-12-14 15:11:16,467 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 62 [2022-12-14 15:11:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:11:16,467 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2022-12-14 15:11:16,467 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 15:11:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-12-14 15:11:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 15:11:16,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:11:16,468 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 15:11:16,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 15:11:16,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:11:16,670 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 15:11:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:11:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1931252352, now seen corresponding path program 1 times [2022-12-14 15:11:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:11:16,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023144019] [2022-12-14 15:11:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:11:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:11:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:11:16,743 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 15:11:16,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:11:16,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023144019] [2022-12-14 15:11:16,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023144019] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:11:16,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176985102] [2022-12-14 15:11:16,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:11:16,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:11:16,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:11:16,745 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:11:16,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 15:11:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:11:16,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:11:16,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:11:16,844 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 15:11:16,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:11:16,892 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 15:11:16,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176985102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:11:16,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [529137831] [2022-12-14 15:11:16,894 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-12-14 15:11:16,894 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:11:16,894 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:11:16,894 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:11:16,894 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:11:17,062 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 15:11:17,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,182 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:11:17,182 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 15:11:17,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,199 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 15:11:17,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,214 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 15:11:17,229 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 15:11:17,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,277 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 15:11:17,709 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 15:11:17,715 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 15:11:17,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,750 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:11:17,751 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 15:11:17,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,803 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:11:17,804 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 15:11:17,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,860 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 15:11:17,861 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 15:11:17,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:17,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:18,036 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 15:11:18,037 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 15:11:24,825 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:11:24,827 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 209 for LOIs [2022-12-14 15:11:24,927 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 28 for LOIs [2022-12-14 15:11:24,928 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 63 for LOIs [2022-12-14 15:11:24,937 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:11:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [529137831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:11:40,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:11:40,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [4, 4, 4] total 40 [2022-12-14 15:11:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141056057] [2022-12-14 15:11:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:11:40,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 15:11:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:11:40,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 15:11:40,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 15:11:40,762 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 15:11:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:11:50,876 INFO L93 Difference]: Finished difference Result 202 states and 240 transitions. [2022-12-14 15:11:50,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 15:11:50,877 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 15:11:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:11:50,878 INFO L225 Difference]: With dead ends: 202 [2022-12-14 15:11:50,878 INFO L226 Difference]: Without dead ends: 155 [2022-12-14 15:11:50,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 146 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=503, Invalid=3037, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 15:11:50,880 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 108 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 4.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:11:50,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 527 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-12-14 15:11:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-12-14 15:11:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 114. [2022-12-14 15:11:50,904 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 15:11:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2022-12-14 15:11:50,904 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 66 [2022-12-14 15:11:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:11:50,905 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2022-12-14 15:11:50,905 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 15:11:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2022-12-14 15:11:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 15:11:50,905 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:11:50,905 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 15:11:50,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 15:11:51,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 15:11:51,107 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 15:11:51,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:11:51,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1745234924, now seen corresponding path program 1 times [2022-12-14 15:11:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:11:51,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956426669] [2022-12-14 15:11:51,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:11:51,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:11:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:11:51,210 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 15:11:51,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:11:51,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956426669] [2022-12-14 15:11:51,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956426669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:11:51,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296030350] [2022-12-14 15:11:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:11:51,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:11:51,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:11:51,212 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:11:51,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 15:11:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:11:51,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:11:51,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:11:51,317 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 15:11:51,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:11:51,366 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 15:11:51,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296030350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:11:51,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1583442720] [2022-12-14 15:11:51,369 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-12-14 15:11:51,369 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:11:51,370 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:11:51,370 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:11:51,370 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:11:51,521 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 15:11:51,525 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 15:11:51,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:51,545 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 15:11:51,545 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 15:11:51,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:51,631 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 15:11:51,631 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 15:11:51,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:51,741 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:11:51,741 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 15:11:51,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:51,796 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 15:11:52,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,336 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:11:52,336 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 15:11:52,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,518 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 15:11:52,518 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 15:11:52,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:11:52,563 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 15:11:52,597 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 15:11:52,606 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 15:11:52,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:11:52,700 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 15:11:54,310 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:11:54,311 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-12-14 15:11:54,331 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 15:11:54,401 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 15:11:54,488 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:12:03,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1583442720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:12:03,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:12:03,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [4, 4, 4] total 41 [2022-12-14 15:12:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435775784] [2022-12-14 15:12:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:12:03,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 15:12:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:12:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 15:12:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 15:12:03,996 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 15:12:12,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:12:12,689 INFO L93 Difference]: Finished difference Result 219 states and 255 transitions. [2022-12-14 15:12:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 15:12:12,690 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 15:12:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:12:12,691 INFO L225 Difference]: With dead ends: 219 [2022-12-14 15:12:12,691 INFO L226 Difference]: Without dead ends: 170 [2022-12-14 15:12:12,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 155 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=454, Invalid=2738, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 15:12:12,692 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 15:12:12,692 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 15:12:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-14 15:12:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2022-12-14 15:12:12,720 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 15:12:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2022-12-14 15:12:12,720 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 66 [2022-12-14 15:12:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:12:12,721 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2022-12-14 15:12:12,721 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 15:12:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2022-12-14 15:12:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 15:12:12,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:12:12,721 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 15:12:12,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 15:12:12,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 15:12:12,923 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 15:12:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:12:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1201815946, now seen corresponding path program 1 times [2022-12-14 15:12:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:12:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830846704] [2022-12-14 15:12:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:12:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:12:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:12:13,012 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 15:12:13,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:12:13,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830846704] [2022-12-14 15:12:13,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830846704] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:12:13,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997767405] [2022-12-14 15:12:13,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:12:13,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:12:13,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:12:13,014 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:12:13,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 15:12:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:12:13,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:12:13,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:12:13,125 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 15:12:13,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:12:13,177 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 15:12:13,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997767405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:12:13,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [81033412] [2022-12-14 15:12:13,180 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-12-14 15:12:13,180 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:12:13,181 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:12:13,181 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:12:13,181 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:12:13,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:13,413 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 15:12:13,414 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 15:12:13,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:13,531 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:12:13,532 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 15:12:13,546 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 15:12:13,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:13,556 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 15:12:13,568 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 15:12:13,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:13,616 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 15:12:14,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,051 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:12:14,051 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 15:12:14,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,203 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 15:12:14,204 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 15:12:14,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,234 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:12:14,234 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 15:12:14,267 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 15:12:14,278 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 15:12:14,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:14,350 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 15:12:16,215 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:12:16,217 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 181 for LOIs [2022-12-14 15:12:16,306 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 15:12:16,378 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 15:12:16,391 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:12:27,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [81033412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:12:27,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:12:27,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-12-14 15:12:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880453256] [2022-12-14 15:12:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:12:27,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 15:12:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:12:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 15:12:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 15:12:27,256 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 15:12:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:12:37,416 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2022-12-14 15:12:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-14 15:12:37,416 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 15:12:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:12:37,417 INFO L225 Difference]: With dead ends: 198 [2022-12-14 15:12:37,417 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 15:12:37,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 158 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=604, Invalid=3428, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 15:12:37,418 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.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:12:37,418 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.6s Time] [2022-12-14 15:12:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 15:12:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-12-14 15:12:37,450 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 15:12:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2022-12-14 15:12:37,451 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 68 [2022-12-14 15:12:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:12:37,452 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2022-12-14 15:12:37,452 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 15:12:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2022-12-14 15:12:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 15:12:37,453 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:12:37,453 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 15:12:37,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 15:12:37,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 15:12:37,655 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 15:12:37,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:12:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1858287266, now seen corresponding path program 1 times [2022-12-14 15:12:37,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:12:37,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721984618] [2022-12-14 15:12:37,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:12:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:12:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:12:37,746 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 15:12:37,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:12:37,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721984618] [2022-12-14 15:12:37,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721984618] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:12:37,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221351813] [2022-12-14 15:12:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:12:37,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:12:37,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:12:37,748 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:12:37,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 15:12:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:12:37,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:12:37,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:12:37,838 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 15:12:37,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:12:37,885 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 15:12:37,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221351813] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:12:37,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1483199842] [2022-12-14 15:12:37,887 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-12-14 15:12:37,888 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:12:37,888 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:12:37,888 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:12:37,888 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:12:38,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:38,029 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 15:12:38,030 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 15:12:38,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:38,122 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 15:12:38,123 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 15:12:38,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:38,252 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:12:38,253 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 15:12:38,272 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 15:12:38,278 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 15:12:38,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:38,320 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 15:12:38,972 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 15:12:38,977 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 15:12:38,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:38,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:38,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:38,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,010 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:12:39,011 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 15:12:39,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:12:39,055 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 15:12:39,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,159 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-12-14 15:12:39,159 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 15:12:39,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:39,305 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 15:12:39,305 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 15:12:39,880 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:12:39,881 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 181 for LOIs [2022-12-14 15:12:39,935 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 160 for LOIs [2022-12-14 15:12:39,978 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 15:12:39,984 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:12:46,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1483199842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:12:46,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:12:46,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-12-14 15:12:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864188585] [2022-12-14 15:12:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:12:46,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 15:12:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:12:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 15:12:46,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1591, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 15:12:46,769 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 15:12:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:12:56,431 INFO L93 Difference]: Finished difference Result 166 states and 188 transitions. [2022-12-14 15:12:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-14 15:12:56,432 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 15:12:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:12:56,432 INFO L225 Difference]: With dead ends: 166 [2022-12-14 15:12:56,432 INFO L226 Difference]: Without dead ends: 115 [2022-12-14 15:12:56,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 156 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=589, Invalid=3443, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 15:12:56,433 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 204 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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 15:12:56,434 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 15:12:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-12-14 15:12:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2022-12-14 15:12:56,458 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 15:12:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-12-14 15:12:56,458 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 68 [2022-12-14 15:12:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:12:56,458 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-12-14 15:12:56,458 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 15:12:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-12-14 15:12:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 15:12:56,459 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:12:56,459 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 15:12:56,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 15:12:56,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:12:56,661 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 15:12:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:12:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1185504466, now seen corresponding path program 1 times [2022-12-14 15:12:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:12:56,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248474684] [2022-12-14 15:12:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:12:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:12:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:12:56,747 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 15:12:56,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:12:56,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248474684] [2022-12-14 15:12:56,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248474684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:12:56,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255243636] [2022-12-14 15:12:56,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:12:56,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:12:56,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:12:56,748 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:12:56,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 15:12:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:12:56,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:12:56,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:12:56,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 15:12:56,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:12:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 15:12:56,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255243636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:12:56,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1204894193] [2022-12-14 15:12:56,903 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-12-14 15:12:56,903 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:12:56,903 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:12:56,903 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:12:56,903 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:12:57,018 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 15:12:57,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 15:12:57,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,137 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 15:12:57,137 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 15:12:57,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,178 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 15:12:57,178 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 15:12:57,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,336 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:12:57,337 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 15:12:57,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,403 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 15:12:57,933 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 15:12:57,939 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 15:12:57,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,967 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:12:57,968 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 15:12:57,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:57,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:58,133 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 15:12:58,133 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 15:12:58,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:58,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:58,165 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:12:58,165 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 15:12:58,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:12:58,261 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 15:12:59,889 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:12:59,891 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 136 for LOIs [2022-12-14 15:12:59,922 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 15:13:00,004 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 34 for LOIs [2022-12-14 15:13:00,008 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:13:08,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1204894193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:13:08,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:13:08,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [4, 4, 4] total 42 [2022-12-14 15:13:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516795693] [2022-12-14 15:13:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:13:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 15:13:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:13:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 15:13:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 15:13:08,888 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 15:13:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:13:12,058 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-12-14 15:13:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 15:13:12,059 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 15:13:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:13:12,060 INFO L225 Difference]: With dead ends: 138 [2022-12-14 15:13:12,060 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 15:13:12,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=300, Invalid=1770, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 15:13:12,062 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 96 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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 15:13:12,062 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 15:13:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 15:13:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2022-12-14 15:13:12,100 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 15:13:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-12-14 15:13:12,101 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 70 [2022-12-14 15:13:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:13:12,101 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-12-14 15:13:12,101 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 15:13:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-12-14 15:13:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 15:13:12,102 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:13:12,102 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 15:13:12,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 15:13:12,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:13:12,303 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 15:13:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:13:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -409280840, now seen corresponding path program 1 times [2022-12-14 15:13:12,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:13:12,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079932538] [2022-12-14 15:13:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:13:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:13:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:13:12,395 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 15:13:12,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:13:12,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079932538] [2022-12-14 15:13:12,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079932538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:13:12,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473638896] [2022-12-14 15:13:12,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:13:12,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:13:12,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:13:12,396 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:13:12,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 15:13:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:13:12,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:13:12,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:13:12,506 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 15:13:12,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:13:12,559 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 15:13:12,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473638896] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:13:12,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1607668467] [2022-12-14 15:13:12,562 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-12-14 15:13:12,562 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:13:12,562 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:13:12,562 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:13:12,562 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:13:12,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:12,820 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:13:12,821 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 15:13:12,842 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 15:13:12,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:12,852 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 15:13:12,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:12,868 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 15:13:12,887 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 15:13:12,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:12,928 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 15:13:13,482 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 15:13:13,487 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 15:13:13,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,517 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:13:13,518 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 15:13:13,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:13:13,562 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 15:13:13,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,673 INFO L321 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2022-12-14 15:13:13,673 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 15:13:13,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:13,809 INFO L321 Elim1Store]: treesize reduction 106, result has 14.5 percent of original size [2022-12-14 15:13:13,810 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 15:13:14,537 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:13:14,539 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 76 for LOIs [2022-12-14 15:13:14,549 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 160 for LOIs [2022-12-14 15:13:14,598 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 15:13:14,675 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:13:22,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1607668467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:13:22,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:13:22,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 43 [2022-12-14 15:13:22,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100594987] [2022-12-14 15:13:22,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:13:22,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 15:13:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:13:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 15:13:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 15:13:22,461 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 15:13:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:13:28,586 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-12-14 15:13:28,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 15:13:28,586 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 15:13:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:13:28,587 INFO L225 Difference]: With dead ends: 112 [2022-12-14 15:13:28,587 INFO L226 Difference]: Without dead ends: 68 [2022-12-14 15:13:28,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 167 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=456, Invalid=2736, Unknown=0, NotChecked=0, Total=3192 [2022-12-14 15:13:28,590 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 107 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:13:28,590 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.8s Time] [2022-12-14 15:13:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-12-14 15:13:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-12-14 15:13:28,604 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 15:13:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2022-12-14 15:13:28,604 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 72 [2022-12-14 15:13:28,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:13:28,605 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2022-12-14 15:13:28,605 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 15:13:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2022-12-14 15:13:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-14 15:13:28,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:13:28,605 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 15:13:28,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 15:13:28,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:13:28,807 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 15:13:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:13:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1037442184, now seen corresponding path program 1 times [2022-12-14 15:13:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:13:28,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636989902] [2022-12-14 15:13:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:13:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:13:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:13:28,903 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 15:13:28,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:13:28,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636989902] [2022-12-14 15:13:28,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636989902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:13:28,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326228927] [2022-12-14 15:13:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:13:28,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:13:28,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:13:28,905 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:13:28,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 15:13:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:13:28,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:13:28,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:13:29,009 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 15:13:29,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:13:29,045 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 15:13:29,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326228927] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:13:29,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2035075868] [2022-12-14 15:13:29,047 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-12-14 15:13:29,047 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:13:29,047 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:13:29,047 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:13:29,047 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:13:29,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:29,254 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:13:29,254 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 15:13:29,268 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 15:13:29,273 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 15:13:29,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:29,282 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 15:13:29,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:29,297 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 15:13:29,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:29,343 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 15:13:30,013 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 15:13:30,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,048 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:13:30,049 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 15:13:30,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,219 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 15:13:30,219 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 15:13:30,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,255 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:13:30,255 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 15:13:30,289 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 15:13:30,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:30,375 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 15:13:32,409 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:13:32,410 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 213 for LOIs [2022-12-14 15:13:32,493 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 15:13:32,568 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 174 for LOIs [2022-12-14 15:13:32,646 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:13:45,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2035075868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:13:45,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:13:45,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 43 [2022-12-14 15:13:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054505829] [2022-12-14 15:13:45,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:13:45,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 15:13:45,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:13:45,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 15:13:45,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1588, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 15:13:45,701 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 15:13:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:13:48,774 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-12-14 15:13:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 15:13:48,774 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 15:13:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:13:48,775 INFO L225 Difference]: With dead ends: 93 [2022-12-14 15:13:48,775 INFO L226 Difference]: Without dead ends: 67 [2022-12-14 15:13:48,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 169 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=323, Invalid=1839, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 15:13:48,776 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:13:48,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 117 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 15:13:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-14 15:13:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-12-14 15:13:48,791 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 15:13:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-12-14 15:13:48,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 72 [2022-12-14 15:13:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:13:48,792 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-12-14 15:13:48,792 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 15:13:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-12-14 15:13:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-14 15:13:48,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:13:48,792 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 15:13:48,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 15:13:48,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 15:13:48,993 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 15:13:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:13:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash 144651394, now seen corresponding path program 1 times [2022-12-14 15:13:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:13:48,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375486305] [2022-12-14 15:13:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:13:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:13:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:13:49,061 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 15:13:49,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:13:49,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375486305] [2022-12-14 15:13:49,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375486305] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:13:49,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056498662] [2022-12-14 15:13:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:13:49,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:13:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:13:49,063 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:13:49,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 15:13:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:13:49,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:13:49,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:13:49,162 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 15:13:49,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:13:49,214 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 15:13:49,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056498662] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:13:49,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1076837399] [2022-12-14 15:13:49,216 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-12-14 15:13:49,216 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:13:49,216 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:13:49,217 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:13:49,217 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:13:49,331 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 15:13:49,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:49,356 INFO L321 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-12-14 15:13:49,356 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 15:13:49,368 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 15:13:49,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:49,476 INFO L321 Elim1Store]: treesize reduction 100, result has 47.6 percent of original size [2022-12-14 15:13:49,476 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 15:13:49,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:49,610 INFO L321 Elim1Store]: treesize reduction 180, result has 33.6 percent of original size [2022-12-14 15:13:49,611 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 15:13:49,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:49,678 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 15:13:50,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,375 INFO L321 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2022-12-14 15:13:50,376 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 15:13:50,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,531 INFO L321 Elim1Store]: treesize reduction 198, result has 33.6 percent of original size [2022-12-14 15:13:50,531 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 15:13:50,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,571 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:13:50,571 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 15:13:50,616 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 15:13:50,626 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 15:13:50,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:13:50,717 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 15:13:52,889 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsTrue with input of size 28 for LOIs [2022-12-14 15:13:52,890 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 28 for LOIs [2022-12-14 15:13:52,892 INFO L197 IcfgInterpreter]: Interpreting procedure staticReturnsFalse with input of size 192 for LOIs [2022-12-14 15:13:52,964 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 103 for LOIs [2022-12-14 15:13:52,971 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:14:05,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1076837399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:14:05,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:14:05,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [4, 4, 4] total 43 [2022-12-14 15:14:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375234417] [2022-12-14 15:14:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:14:05,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 15:14:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:14:05,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 15:14:05,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=1573, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 15:14:05,071 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 15:14:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:14:06,991 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-12-14 15:14:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 15:14:06,992 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 15:14:06,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:14:06,993 INFO L225 Difference]: With dead ends: 67 [2022-12-14 15:14:06,993 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 15:14:06,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 173 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=331, Invalid=1739, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 15:14:06,994 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.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:14:06,995 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.5s Time] [2022-12-14 15:14:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 15:14:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 15:14:06,995 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 15:14:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 15:14:06,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-12-14 15:14:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:14:06,995 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 15:14:06,996 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 15:14:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 15:14:06,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 15:14:06,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 15:14:06,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 15:14:06,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 15:14:06,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 15:14:06,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 15:14:06,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 15:14:06,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 15:14:06,999 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 15:14:07,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 15:14:07,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 15:14:07,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 15:14:20,827 WARN L233 SmtUtils]: Spent 8.23s 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 15:14:30,148 WARN L233 SmtUtils]: Spent 7.44s 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 15:14:44,028 WARN L233 SmtUtils]: Spent 6.64s 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 15:14:53,822 WARN L233 SmtUtils]: Spent 6.14s 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 15:14:53,826 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-14 15:14:53,826 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-14 15:14:53,826 INFO L899 garLoopResultBuilder]: For program point staticReturnsFalseEXIT(lines 1552 1555) no Hoare annotation was computed. [2022-12-14 15:14:53,826 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1552 1555) the Hoare annotation is: true [2022-12-14 15:14:53,826 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-14 15:14:53,826 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-14 15:14:53,827 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-12-14 15:14:53,827 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-12-14 15:14:53,827 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1591) no Hoare annotation was computed. [2022-12-14 15:14:53,827 INFO L899 garLoopResultBuilder]: For program point L1580-1(lines 1556 1593) no Hoare annotation was computed. [2022-12-14 15:14:53,827 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-14 15:14:53,827 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2022-12-14 15:14:53,827 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1571) no Hoare annotation was computed. [2022-12-14 15:14:53,828 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) 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 15:14:53,828 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1625) no Hoare annotation was computed. [2022-12-14 15:14:53,828 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1584) no Hoare annotation was computed. [2022-12-14 15:14:53,828 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) 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 15:14:53,829 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-12-14 15:14:53,829 INFO L899 garLoopResultBuilder]: For program point L1598-2(lines 1598 1611) no Hoare annotation was computed. [2022-12-14 15:14:53,829 INFO L895 garLoopResultBuilder]: At program point L1598-4(lines 1598 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_~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 15:14:53,830 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) 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 15:14:53,830 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1590) no Hoare annotation was computed. [2022-12-14 15:14:53,830 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 15:14:53,830 INFO L899 garLoopResultBuilder]: For program point L1640(line 1640) no Hoare annotation was computed. [2022-12-14 15:14:53,830 INFO L899 garLoopResultBuilder]: For program point L1640-1(lines 1640 1647) no Hoare annotation was computed. [2022-12-14 15:14:53,830 INFO L899 garLoopResultBuilder]: For program point L1574(line 1574) no Hoare annotation was computed. [2022-12-14 15:14:53,830 INFO L899 garLoopResultBuilder]: For program point L1574-1(lines 1574 1592) no Hoare annotation was computed. [2022-12-14 15:14:53,831 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) 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 15:14:53,832 INFO L899 garLoopResultBuilder]: For program point L1632-1(line 1632) no Hoare annotation was computed. [2022-12-14 15:14:53,832 INFO L899 garLoopResultBuilder]: For program point L1632-2(lines 1632 1639) no Hoare annotation was computed. [2022-12-14 15:14:53,833 INFO L895 garLoopResultBuilder]: At program point L1632-3(lines 1632 1639) 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 15:14:53,833 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2022-12-14 15:14:53,833 INFO L899 garLoopResultBuilder]: For program point L1657-1(lines 1657 1664) no Hoare annotation was computed. [2022-12-14 15:14:53,833 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 1665) no Hoare annotation was computed. [2022-12-14 15:14:53,833 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1624) no Hoare annotation was computed. [2022-12-14 15:14:53,834 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) 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 15:14:53,834 INFO L899 garLoopResultBuilder]: For program point L1608-1(lines 1602 1609) no Hoare annotation was computed. [2022-12-14 15:14:53,834 INFO L899 garLoopResultBuilder]: For program point L1584(line 1584) no Hoare annotation was computed. [2022-12-14 15:14:53,834 INFO L899 garLoopResultBuilder]: For program point L1584-1(line 1584) no Hoare annotation was computed. [2022-12-14 15:14:53,834 INFO L899 garLoopResultBuilder]: For program point L1642(lines 1642 1646) no Hoare annotation was computed. [2022-12-14 15:14:53,834 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: false [2022-12-14 15:14:53,834 INFO L895 garLoopResultBuilder]: At program point L1634(line 1634) the Hoare annotation is: false [2022-12-14 15:14:53,834 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2022-12-14 15:14:53,834 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-12-14 15:14:53,835 INFO L895 garLoopResultBuilder]: At program point L1560(line 1560) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 15:14:53,835 INFO L899 garLoopResultBuilder]: For program point L1560-1(line 1560) no Hoare annotation was computed. [2022-12-14 15:14:53,835 INFO L899 garLoopResultBuilder]: For program point L1560-2(lines 1560 1573) no Hoare annotation was computed. [2022-12-14 15:14:53,835 INFO L895 garLoopResultBuilder]: At program point L1560-4(lines 1560 1573) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#valid| 1) 1) (= 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 15:14:53,835 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-12-14 15:14:53,836 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) 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 15:14:53,836 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-12-14 15:14:53,836 INFO L895 garLoopResultBuilder]: At program point L1676(line 1676) 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 15:14:53,836 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-12-14 15:14:53,837 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 1609) no Hoare annotation was computed. [2022-12-14 15:14:53,837 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 15:14:53,837 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1644) no Hoare annotation was computed. [2022-12-14 15:14:53,837 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1627) no Hoare annotation was computed. [2022-12-14 15:14:53,837 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) 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 15:14:53,838 INFO L899 garLoopResultBuilder]: For program point L1644(line 1644) no Hoare annotation was computed. [2022-12-14 15:14:53,838 INFO L899 garLoopResultBuilder]: For program point L1644-1(line 1644) no Hoare annotation was computed. [2022-12-14 15:14:53,838 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: (and (= (select |#length| 9) 21) (= ~GLOBAL_CONST_FALSE~0 0) (= (select |#length| 6) 1) (= 1 (select |#valid| 5)) (= (select (select |#memory_int| 2) 0) 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select |#valid| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 1) (= (select |#valid| 9) 1) (= (select |#valid| 11) 1) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= 21 (select |#length| 4)) (= (select |#valid| 7) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= (select |#length| 10) 18) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G1_~data~0#1| 0) (= 16 (select |#length| 7)) (= (select |#length| 5) 54) (= (select |#valid| 4) 1) (= 16 (select |#length| 3)) (= (select |#length| 2) 1) (= (select |#memory_int| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (store ((as const (Array Int Int)) 0) |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0)) (= (select |#valid| 1) 1) (= 16 (select |#length| 11)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select (select |#memory_int| 6) 0) 0) (= (select |#valid| 0) 0) (= (select |#length| 1) 1) (= |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.offset| 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= (select |#length| 8) 54) (= 5 ~globalFive~0) (= (select |#valid| 10) 1) (= (select |#length| |ULTIMATE.start_goodB2G1_~#inputBuffer~0#1.base|) 14) (= (select |#valid| 8) 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 15:14:53,838 INFO L899 garLoopResultBuilder]: For program point L1570-1(lines 1564 1571) no Hoare annotation was computed. [2022-12-14 15:14:53,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-12-14 15:14:53,838 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-12-14 15:14:53,838 INFO L899 garLoopResultBuilder]: For program point L1628(lines 1628 1648) no Hoare annotation was computed. [2022-12-14 15:14:53,839 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-12-14 15:14:53,840 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) 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 15:14:53,840 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-12-14 15:14:53,841 INFO L895 garLoopResultBuilder]: At program point L1653-4(lines 1653 1656) 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 15:14:53,841 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-12-14 15:14:53,842 INFO L895 garLoopResultBuilder]: At program point L1645(line 1645) 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 15:14:53,842 INFO L902 garLoopResultBuilder]: At program point L1678-1(line 1678) the Hoare annotation is: true [2022-12-14 15:14:53,842 INFO L899 garLoopResultBuilder]: For program point L1612(line 1612) no Hoare annotation was computed. [2022-12-14 15:14:53,842 INFO L899 garLoopResultBuilder]: For program point L1612-1(lines 1612 1626) no Hoare annotation was computed. [2022-12-14 15:14:53,842 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-14 15:14:53,842 INFO L899 garLoopResultBuilder]: For program point staticReturnsTrueEXIT(lines 1548 1551) no Hoare annotation was computed. [2022-12-14 15:14:53,842 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1548 1551) the Hoare annotation is: true [2022-12-14 15:14:53,845 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 15:14:53,847 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:14:53,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:14:53 BoogieIcfgContainer [2022-12-14 15:14:53,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:14:53,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:14:53,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:14:53,855 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:14:53,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:10:42" (3/4) ... [2022-12-14 15:14:53,857 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 15:14:53,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-14 15:14:53,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2022-12-14 15:14:53,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-14 15:14:53,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2022-12-14 15:14:53,864 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-12-14 15:14:53,864 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-12-14 15:14:53,864 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 15:14:53,864 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 15:14:53,864 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 15:14:53,894 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 15:14:53,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:14:53,895 INFO L158 Benchmark]: Toolchain (without parser) took 252435.72ms. Allocated memory was 192.9MB in the beginning and 295.7MB in the end (delta: 102.8MB). Free memory was 119.4MB in the beginning and 90.4MB in the end (delta: 29.1MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. [2022-12-14 15:14:53,895 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 192.9MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:14:53,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 816.75ms. Allocated memory is still 192.9MB. Free memory was 119.2MB in the beginning and 119.3MB in the end (delta: -106.9kB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2022-12-14 15:14:53,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.95ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 115.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 15:14:53,896 INFO L158 Benchmark]: Boogie Preprocessor took 20.39ms. Allocated memory is still 192.9MB. Free memory was 115.4MB in the beginning and 114.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:14:53,896 INFO L158 Benchmark]: RCFGBuilder took 358.81ms. Allocated memory is still 192.9MB. Free memory was 114.2MB in the beginning and 93.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 15:14:53,896 INFO L158 Benchmark]: TraceAbstraction took 251155.99ms. Allocated memory was 192.9MB in the beginning and 295.7MB in the end (delta: 102.8MB). Free memory was 92.3MB in the beginning and 94.6MB in the end (delta: -2.3MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. [2022-12-14 15:14:53,896 INFO L158 Benchmark]: Witness Printer took 39.94ms. Allocated memory is still 295.7MB. Free memory was 94.6MB in the beginning and 90.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 15:14:53,897 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.18ms. Allocated memory is still 192.9MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 816.75ms. Allocated memory is still 192.9MB. Free memory was 119.2MB in the beginning and 119.3MB in the end (delta: -106.9kB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.95ms. Allocated memory is still 192.9MB. Free memory was 119.3MB in the beginning and 115.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.39ms. Allocated memory is still 192.9MB. Free memory was 115.4MB in the beginning and 114.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 358.81ms. Allocated memory is still 192.9MB. Free memory was 114.2MB in the beginning and 93.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 251155.99ms. Allocated memory was 192.9MB in the beginning and 295.7MB in the end (delta: 102.8MB). Free memory was 92.3MB in the beginning and 94.6MB in the end (delta: -2.3MB). Peak memory consumption was 139.1MB. Max. memory is 16.1GB. * Witness Printer took 39.94ms. Allocated memory is still 295.7MB. Free memory was 94.6MB in the beginning and 90.4MB 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: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1584]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1644]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: 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: 251.1s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 70.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 46.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1313 SdHoareTripleChecker+Valid, 27.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1143 mSDsluCounter, 5403 SdHoareTripleChecker+Invalid, 25.4s 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, 135.4s 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, 44.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s 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.5s, 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.2s, TOOLS_POST_CALL_APPLICATIONS: 306, TOOLS_POST_CALL_TIME: 7.8s, TOOLS_POST_RETURN_APPLICATIONS: 204, TOOLS_POST_RETURN_TIME: 5.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 894, TOOLS_QUANTIFIERELIM_TIME: 28.1s, 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.7s, 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: 18932, DAG_COMPRESSION_RETAINED_NODES: 1329, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1678]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 15:14:53,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abf5b7c6-ef38-454f-a785-196c6ecd8150/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