./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/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_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/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_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/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 0dfd86504ec51385fcf4065bb94bbc6e4d8b669d9b1bf39730438b67cc387928 --- 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 09:10:04,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:10:04,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:10:04,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:10:04,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:10:04,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:10:04,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:10:04,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:10:04,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:10:04,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:10:04,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:10:04,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:10:04,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:10:04,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:10:04,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:10:04,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:10:04,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:10:04,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:10:04,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:10:04,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:10:04,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:10:04,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:10:04,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:10:04,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:10:04,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:10:04,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:10:04,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:10:04,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:10:04,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:10:04,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:10:04,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:10:04,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:10:04,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:10:04,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:10:04,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:10:04,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:10:04,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:10:04,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:10:04,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:10:04,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:10:04,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:10:04,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 09:10:04,510 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:10:04,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:10:04,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:10:04,510 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:10:04,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:10:04,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:10:04,511 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:10:04,511 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:10:04,511 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:10:04,512 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:10:04,512 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:10:04,512 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:10:04,512 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:10:04,512 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:10:04,512 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:10:04,512 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:10:04,512 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:10:04,513 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:10:04,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:10:04,513 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:10:04,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:10:04,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:10:04,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 09:10:04,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:10:04,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 09:10:04,514 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 09:10:04,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 09:10:04,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:10:04,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 09:10:04,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:10:04,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:10:04,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:10:04,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:10:04,515 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:10:04,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:10:04,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 09:10:04,515 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:10:04,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:10:04,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 09:10:04,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:10:04,516 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_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/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_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/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 -> 0dfd86504ec51385fcf4065bb94bbc6e4d8b669d9b1bf39730438b67cc387928 [2022-12-14 09:10:04,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:10:04,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:10:04,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:10:04,698 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:10:04,699 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:10:04,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i [2022-12-14 09:10:07,244 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:10:07,513 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:10:07,513 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i [2022-12-14 09:10:07,531 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/data/633213e8b/9c29d2db152543d293efeb9748bfe632/FLAG01c844b59 [2022-12-14 09:10:07,811 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/data/633213e8b/9c29d2db152543d293efeb9748bfe632 [2022-12-14 09:10:07,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:10:07,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:10:07,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:10:07,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:10:07,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:10:07,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:10:07" (1/1) ... [2022-12-14 09:10:07,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d78ff19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:07, skipping insertion in model container [2022-12-14 09:10:07,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:10:07" (1/1) ... [2022-12-14 09:10:07,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:10:07,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:10:08,163 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 09:10:08,465 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 09:10:08,470 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 09:10:08,472 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 09:10:08,475 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 09:10:08,475 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 09:10:08,505 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 09:10:08,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:10:08,515 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:10:08,535 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 09:10:08,569 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-14 09:10:08,571 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 09:10:08,571 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-14 09:10:08,573 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 09:10:08,574 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-14 09:10:08,578 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-14 09:10:08,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:10:08,673 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:10:08,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08 WrapperNode [2022-12-14 09:10:08,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:10:08,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:10:08,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:10:08,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:10:08,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,711 INFO L138 Inliner]: procedures = 501, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2022-12-14 09:10:08,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:10:08,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:10:08,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:10:08,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:10:08,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,730 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:10:08,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:10:08,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:10:08,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:10:08,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (1/1) ... [2022-12-14 09:10:08,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:10:08,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:08,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:10:08,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:10:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-14 09:10:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-14 09:10:08,785 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-14 09:10:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-14 09:10:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:10:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 09:10:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 09:10:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:10:08,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:10:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:10:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-14 09:10:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 09:10:08,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 09:10:08,893 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:10:08,894 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:10:09,028 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:10:09,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:10:09,058 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 09:10:09,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:10:09 BoogieIcfgContainer [2022-12-14 09:10:09,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:10:09,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:10:09,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:10:09,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:10:09,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:10:07" (1/3) ... [2022-12-14 09:10:09,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fb530e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:10:09, skipping insertion in model container [2022-12-14 09:10:09,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:10:08" (2/3) ... [2022-12-14 09:10:09,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fb530e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:10:09, skipping insertion in model container [2022-12-14 09:10:09,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:10:09" (3/3) ... [2022-12-14 09:10:09,067 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_preinc_17_good.i [2022-12-14 09:10:09,081 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:10:09,082 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-14 09:10:09,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:10:09,121 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;@3875a50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:10:09,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-12-14 09:10:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 09:10:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 09:10:09,130 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:09,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:09,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:09,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:09,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1827108335, now seen corresponding path program 1 times [2022-12-14 09:10:09,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:09,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80105616] [2022-12-14 09:10:09,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:09,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:09,356 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 09:10:09,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:09,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80105616] [2022-12-14 09:10:09,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80105616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:09,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:09,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:10:09,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833928637] [2022-12-14 09:10:09,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:09,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:09,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:09,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:09,387 INFO L87 Difference]: Start difference. First operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:09,451 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-12-14 09:10:09,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:09,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2022-12-14 09:10:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:09,458 INFO L225 Difference]: With dead ends: 85 [2022-12-14 09:10:09,459 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 09:10:09,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:10:09,463 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:09,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 09:10:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 09:10:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-12-14 09:10:09,492 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2022-12-14 09:10:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:09,493 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-12-14 09:10:09,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-12-14 09:10:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 09:10:09,494 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:09,494 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:09,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:10:09,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:09,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1263926376, now seen corresponding path program 1 times [2022-12-14 09:10:09,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:09,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974235307] [2022-12-14 09:10:09,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:09,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:09,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974235307] [2022-12-14 09:10:09,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974235307] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:09,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148008317] [2022-12-14 09:10:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:09,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:09,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:09,612 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:09,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:10:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:09,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:10:09,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:09,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:10:09,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148008317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:09,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:10:09,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 09:10:09,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951771246] [2022-12-14 09:10:09,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:09,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:10:09,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:09,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:10:09,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:10:09,741 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:09,777 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-12-14 09:10:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:10:09,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-12-14 09:10:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:09,778 INFO L225 Difference]: With dead ends: 78 [2022-12-14 09:10:09,778 INFO L226 Difference]: Without dead ends: 40 [2022-12-14 09:10:09,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:10:09,780 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:09,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:09,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-14 09:10:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-12-14 09:10:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-12-14 09:10:09,787 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2022-12-14 09:10:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:09,787 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-12-14 09:10:09,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-12-14 09:10:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 09:10:09,787 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:09,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:09,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:10:09,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:09,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash -842094357, now seen corresponding path program 1 times [2022-12-14 09:10:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:09,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933261080] [2022-12-14 09:10:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:10:10,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:10,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933261080] [2022-12-14 09:10:10,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933261080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:10,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:10,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:10:10,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465274190] [2022-12-14 09:10:10,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:10,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:10:10,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:10,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:10:10,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:10:10,271 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:10,330 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-12-14 09:10:10,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:10:10,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-14 09:10:10,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:10,331 INFO L225 Difference]: With dead ends: 40 [2022-12-14 09:10:10,332 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 09:10:10,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:10:10,333 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:10,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 102 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 09:10:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-12-14 09:10:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.5) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-12-14 09:10:10,341 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2022-12-14 09:10:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:10,341 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-12-14 09:10:10,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-12-14 09:10:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 09:10:10,342 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:10,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:10,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 09:10:10,342 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash -841995654, now seen corresponding path program 1 times [2022-12-14 09:10:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:10,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678097821] [2022-12-14 09:10:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:10:10,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:10,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678097821] [2022-12-14 09:10:10,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678097821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:10,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:10,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:10:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969136324] [2022-12-14 09:10:10,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:10,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:10:10,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:10:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:10:10,380 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:10,404 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-12-14 09:10:10,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:10:10,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-14 09:10:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:10,405 INFO L225 Difference]: With dead ends: 69 [2022-12-14 09:10:10,405 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 09:10:10,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 09:10:10,406 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 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 09:10:10,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 09:10:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-12-14 09:10:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-12-14 09:10:10,414 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 12 [2022-12-14 09:10:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:10,415 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-12-14 09:10:10,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-12-14 09:10:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:10:10,416 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:10,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:10,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 09:10:10,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:10,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash -335121214, now seen corresponding path program 1 times [2022-12-14 09:10:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:10,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856968432] [2022-12-14 09:10:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 09:10:10,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:10,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856968432] [2022-12-14 09:10:10,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856968432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:10,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:10,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:10:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688971119] [2022-12-14 09:10:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:10,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:10,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:10,467 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:10,497 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-12-14 09:10:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:10,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-14 09:10:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:10,499 INFO L225 Difference]: With dead ends: 40 [2022-12-14 09:10:10,499 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 09:10:10,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 09:10:10,500 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:10,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 09:10:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-12-14 09:10:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 33 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-12-14 09:10:10,507 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2022-12-14 09:10:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:10,507 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-12-14 09:10:10,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 09:10:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-12-14 09:10:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 09:10:10,508 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:10,508 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:10,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 09:10:10,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1823320998, now seen corresponding path program 1 times [2022-12-14 09:10:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:10,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921661771] [2022-12-14 09:10:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:10:10,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:10,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921661771] [2022-12-14 09:10:10,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921661771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:10,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:10,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:10:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929428239] [2022-12-14 09:10:10,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:10,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:10,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:10,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:10,558 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:10,594 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-12-14 09:10:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:10,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-12-14 09:10:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:10,595 INFO L225 Difference]: With dead ends: 49 [2022-12-14 09:10:10,596 INFO L226 Difference]: Without dead ends: 47 [2022-12-14 09:10:10,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:10:10,597 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:10,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 94 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-14 09:10:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-12-14 09:10:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:10:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-12-14 09:10:10,604 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 16 [2022-12-14 09:10:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:10,604 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-12-14 09:10:10,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 09:10:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-12-14 09:10:10,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 09:10:10,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:10,605 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:10,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 09:10:10,605 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1059501338, now seen corresponding path program 1 times [2022-12-14 09:10:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:10,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739140219] [2022-12-14 09:10:10,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:10:10,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:10,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739140219] [2022-12-14 09:10:10,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739140219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:10,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:10,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:10:10,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632522263] [2022-12-14 09:10:10,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:10,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:10,659 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:10:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:10,685 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-12-14 09:10:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:10,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-12-14 09:10:10,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:10,686 INFO L225 Difference]: With dead ends: 65 [2022-12-14 09:10:10,686 INFO L226 Difference]: Without dead ends: 50 [2022-12-14 09:10:10,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:10:10,688 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:10,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-14 09:10:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-14 09:10:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 43 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 09:10:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-12-14 09:10:10,695 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 20 [2022-12-14 09:10:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:10,695 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-12-14 09:10:10,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:10:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-12-14 09:10:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 09:10:10,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:10,696 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:10,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 09:10:10,696 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:10,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:10,697 INFO L85 PathProgramCache]: Analyzing trace with hash 186814202, now seen corresponding path program 1 times [2022-12-14 09:10:10,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:10,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018329724] [2022-12-14 09:10:10,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:10,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 09:10:10,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018329724] [2022-12-14 09:10:10,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018329724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:10,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261061145] [2022-12-14 09:10:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:10,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:10,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:10,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:10,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:10:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:10,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:10:10,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 09:10:10,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:10:10,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261061145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:10,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:10:10,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 09:10:10,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797746884] [2022-12-14 09:10:10,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:10,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:10:10,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:10,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:10:10,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:10:10,856 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:10,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:10,891 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-12-14 09:10:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:10:10,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-12-14 09:10:10,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:10,892 INFO L225 Difference]: With dead ends: 74 [2022-12-14 09:10:10,892 INFO L226 Difference]: Without dead ends: 40 [2022-12-14 09:10:10,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:10:10,893 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:10,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-14 09:10:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-12-14 09:10:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 34 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-12-14 09:10:10,898 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 24 [2022-12-14 09:10:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:10,899 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-12-14 09:10:10,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-12-14 09:10:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 09:10:10,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:10,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:10,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:10:11,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:11,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash -110190178, now seen corresponding path program 1 times [2022-12-14 09:10:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:11,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932746432] [2022-12-14 09:10:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:11,146 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 09:10:11,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:11,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932746432] [2022-12-14 09:10:11,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932746432] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:11,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92196577] [2022-12-14 09:10:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:11,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:11,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:11,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:11,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:10:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:11,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 09:10:11,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:10:11,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:10:11,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92196577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:11,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:10:11,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 09:10:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055565680] [2022-12-14 09:10:11,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:11,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:10:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:11,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:10:11,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:10:11,251 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:10:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:11,279 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-12-14 09:10:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:10:11,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-12-14 09:10:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:11,280 INFO L225 Difference]: With dead ends: 54 [2022-12-14 09:10:11,280 INFO L226 Difference]: Without dead ends: 36 [2022-12-14 09:10:11,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-14 09:10:11,281 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:11,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-14 09:10:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-12-14 09:10:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 30 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-12-14 09:10:11,285 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 23 [2022-12-14 09:10:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:11,285 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-12-14 09:10:11,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:10:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-12-14 09:10:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 09:10:11,285 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:11,285 INFO L195 NwaCegarLoop]: trace histogram [2, 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 09:10:11,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 09:10:11,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:11,487 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:11,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:11,487 INFO L85 PathProgramCache]: Analyzing trace with hash 879077138, now seen corresponding path program 1 times [2022-12-14 09:10:11,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:11,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090239875] [2022-12-14 09:10:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:11,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:10:11,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:11,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090239875] [2022-12-14 09:10:11,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090239875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:11,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:11,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:10:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209567784] [2022-12-14 09:10:11,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:11,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:10:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:11,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:10:11,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:10:11,591 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:10:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:11,640 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-12-14 09:10:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:10:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-12-14 09:10:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:11,642 INFO L225 Difference]: With dead ends: 41 [2022-12-14 09:10:11,642 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 09:10:11,642 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 09:10:11,643 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:11,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 09:10:11,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-12-14 09:10:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 33 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-12-14 09:10:11,648 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 24 [2022-12-14 09:10:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:11,649 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-12-14 09:10:11,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 09:10:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-12-14 09:10:11,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 09:10:11,649 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:11,649 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:11,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 09:10:11,650 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:11,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:11,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1473090570, now seen corresponding path program 1 times [2022-12-14 09:10:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:11,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490651988] [2022-12-14 09:10:11,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:11,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:10:11,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:11,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490651988] [2022-12-14 09:10:11,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490651988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:11,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:10:11,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:10:11,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71168443] [2022-12-14 09:10:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:11,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:11,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:11,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:10:11,693 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 09:10:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:11,724 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-12-14 09:10:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-12-14 09:10:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:11,725 INFO L225 Difference]: With dead ends: 45 [2022-12-14 09:10:11,725 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 09:10:11,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:10:11,725 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:11,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 09:10:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-14 09:10:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 32 states have (on average 1.15625) internal successors, (37), 36 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 09:10:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-12-14 09:10:11,729 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 30 [2022-12-14 09:10:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:11,729 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-12-14 09:10:11,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 09:10:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-12-14 09:10:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 09:10:11,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:11,730 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 09:10:11,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 09:10:11,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1134530918, now seen corresponding path program 1 times [2022-12-14 09:10:11,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:11,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347046771] [2022-12-14 09:10:11,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:10:11,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:11,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347046771] [2022-12-14 09:10:11,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347046771] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:11,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414876694] [2022-12-14 09:10:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:11,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:11,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:10:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:11,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:10:11,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:10:11,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 09:10:11,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414876694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:11,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 09:10:11,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-12-14 09:10:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082353474] [2022-12-14 09:10:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:11,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:10:11,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:11,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:10:11,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:10:11,883 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 09:10:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:11,899 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-12-14 09:10:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:10:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-12-14 09:10:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:11,900 INFO L225 Difference]: With dead ends: 43 [2022-12-14 09:10:11,900 INFO L226 Difference]: Without dead ends: 42 [2022-12-14 09:10:11,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:10:11,900 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:11,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:10:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-14 09:10:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-12-14 09:10:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 09:10:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-12-14 09:10:11,904 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 33 [2022-12-14 09:10:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:11,904 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-12-14 09:10:11,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 09:10:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-12-14 09:10:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 09:10:11,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:11,905 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 09:10:11,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:10:12,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 09:10:12,105 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:12,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:12,106 INFO L85 PathProgramCache]: Analyzing trace with hash -810719967, now seen corresponding path program 1 times [2022-12-14 09:10:12,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:12,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853236116] [2022-12-14 09:10:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:10:12,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:12,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853236116] [2022-12-14 09:10:12,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853236116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:12,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744455561] [2022-12-14 09:10:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:12,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:12,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:10:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:12,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:10:12,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:10:12,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:10:12,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744455561] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:12,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [560715389] [2022-12-14 09:10:12,310 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-12-14 09:10:12,311 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:12,315 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:12,320 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:12,321 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:12,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:12,542 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 09:10:12,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 09:10:12,555 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 09:10:12,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:12,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:10:12,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:12,612 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 09:10:12,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 09:10:12,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:12,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:12,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:12,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-12-14 09:10:12,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:13,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:13,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 49 [2022-12-14 09:10:14,002 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 82 for LOIs [2022-12-14 09:10:14,017 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 120 for LOIs [2022-12-14 09:10:14,078 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:18,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [560715389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:18,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:18,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [5, 3, 3] total 26 [2022-12-14 09:10:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912968000] [2022-12-14 09:10:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:18,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 09:10:18,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 09:10:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-12-14 09:10:18,505 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:19,146 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-12-14 09:10:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 09:10:19,146 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-12-14 09:10:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:19,147 INFO L225 Difference]: With dead ends: 69 [2022-12-14 09:10:19,147 INFO L226 Difference]: Without dead ends: 41 [2022-12-14 09:10:19,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-12-14 09:10:19,148 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:19,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 110 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 09:10:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-12-14 09:10:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-12-14 09:10:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.09375) internal successors, (35), 34 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 09:10:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-12-14 09:10:19,163 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2022-12-14 09:10:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:19,164 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-12-14 09:10:19,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-12-14 09:10:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 09:10:19,165 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:10:19,165 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 09:10:19,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:10:19,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 09:10:19,366 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-12-14 09:10:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:10:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 855771952, now seen corresponding path program 1 times [2022-12-14 09:10:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:10:19,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158650698] [2022-12-14 09:10:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:10:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 09:10:19,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:10:19,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158650698] [2022-12-14 09:10:19,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158650698] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:10:19,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042189295] [2022-12-14 09:10:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:10:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:19,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:10:19,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:10:19,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:10:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:10:19,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 09:10:19,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:10:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:10:19,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:10:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 09:10:19,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042189295] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:10:19,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [629247063] [2022-12-14 09:10:19,598 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-12-14 09:10:19,598 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:10:19,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:10:19,598 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:10:19,598 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:10:19,660 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 09:10:19,665 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 09:10:19,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:19,696 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2022-12-14 09:10:19,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 50 [2022-12-14 09:10:19,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:19,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:10:19,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:19,749 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-12-14 09:10:19,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 61 [2022-12-14 09:10:19,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:19,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-12-14 09:10:19,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:19,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:19,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:19,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-14 09:10:19,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:19,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:20,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:20,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-14 09:10:20,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:20,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 09:10:20,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:10:20,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 49 [2022-12-14 09:10:20,910 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 137 for LOIs [2022-12-14 09:10:20,968 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 62 for LOIs [2022-12-14 09:10:20,973 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:10:26,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [629247063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:10:26,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:10:26,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 3, 3] total 27 [2022-12-14 09:10:26,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359211598] [2022-12-14 09:10:26,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:10:26,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 09:10:26,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:10:26,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 09:10:26,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-12-14 09:10:26,188 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:10:26,755 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-12-14 09:10:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 09:10:26,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-12-14 09:10:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:10:26,756 INFO L225 Difference]: With dead ends: 41 [2022-12-14 09:10:26,756 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 09:10:26,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-12-14 09:10:26,756 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:10:26,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 09:10:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 09:10:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 09:10:26,757 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 09:10:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 09:10:26,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-12-14 09:10:26,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:10:26,757 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 09:10:26,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 09:10:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 09:10:26,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 09:10:26,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-12-14 09:10:26,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-12-14 09:10:26,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-12-14 09:10:26,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-12-14 09:10:26,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-12-14 09:10:26,760 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-12-14 09:10:26,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-12-14 09:10:26,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-12-14 09:10:26,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-12-14 09:10:26,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-12-14 09:10:26,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-12-14 09:10:26,761 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-12-14 09:10:26,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 09:10:26,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:10:26,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 09:10:31,599 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-14 09:10:31,599 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-14 09:10:31,600 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-14 09:10:31,600 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-14 09:10:31,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-12-14 09:10:31,600 INFO L895 garLoopResultBuilder]: At program point L1567(line 1567) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G_~k~0#1| 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 |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |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 |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (<= 2147483647 .cse0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|) (= ~globalArgc~0 0) (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1) (= 5 ~globalFive~0) (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0) (<= .cse0 2147483647) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-12-14 09:10:31,600 INFO L899 garLoopResultBuilder]: For program point L1567-1(lines 1557 1569) no Hoare annotation was computed. [2022-12-14 09:10:31,601 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G_~k~0#1| 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 |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse0) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |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 |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (<= 0 (+ 2147483647 .cse0)) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|) (= ~globalArgc~0 0) (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1) (= 5 ~globalFive~0) (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0) (<= .cse0 2147483647) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1))) [2022-12-14 09:10:31,601 INFO L899 garLoopResultBuilder]: For program point L1559(lines 1559 1568) no Hoare annotation was computed. [2022-12-14 09:10:31,601 INFO L899 garLoopResultBuilder]: For program point L1580-2(line 1580) no Hoare annotation was computed. [2022-12-14 09:10:31,601 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-12-14 09:10:31,601 INFO L899 garLoopResultBuilder]: For program point L1580-3(line 1580) no Hoare annotation was computed. [2022-12-14 09:10:31,601 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-12-14 09:10:31,602 INFO L895 garLoopResultBuilder]: At program point L1580-4(lines 1580 1587) the Hoare annotation is: (let ((.cse14 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse38 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= 0 (+ 2147483647 .cse38)) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (<= .cse38 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse38) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0)))))) (.cse6 (<= 3 |ULTIMATE.start_goodG2B_~data~1#1|)) (.cse17 (<= |ULTIMATE.start_goodG2B_~result~1#1| 3)) (.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse34 (= |ULTIMATE.start_goodG2B_~j~0#1| 0)) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= ~globalArgv~0.offset 0)) (.cse35 (= |ULTIMATE.start_goodG2B_~data~1#1| 2)) (.cse36 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse37 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= .cse37 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (<= 2147483647 .cse37) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0)))))) (.cse7 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse8 (= (select |#valid| 3) 1)) (.cse9 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse12 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse13 (= (select |#valid| 4) 1)) (.cse15 (= (select |#length| 3) 18)) (.cse16 (= (select |#valid| 1) 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse19 (= ~globalArgv~0.base 0)) (.cse20 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse21 (= (select |#valid| 0) 0)) (.cse22 (= 54 (select |#length| 2))) (.cse23 (= (select |#length| 1) 1)) (.cse24 (= (select |#valid| 2) 1)) (.cse25 (= 16 (select |#length| 4))) (.cse26 (= |#NULL.offset| 0)) (.cse27 (= ~globalFalse~0 0)) (.cse28 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse29 (= ~globalArgc~0 0)) (.cse30 (= 5 ~globalFive~0)) (.cse31 (< 0 |#StackHeapBarrier|)) (.cse32 (= |#NULL.base| 0)) (.cse33 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_goodG2B_~j~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 .cse35 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and (<= 0 ~GLOBAL_CONST_FALSE~0) (<= ~globalTrue~0 1) (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) (<= ~globalArgc~0 0) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_goodG2B_~h~0#1| 1) (<= 5 ~globalFive~0) .cse2 .cse3 (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) (<= 1 |ULTIMATE.start_goodG2B_~j~0#1|) (<= 1 |ULTIMATE.start_goodG2B_~h~0#1|) (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) .cse4 (<= ~globalFalse~0 0) .cse36 .cse6 (<= ~GLOBAL_CONST_FIVE~0 5) (<= |ULTIMATE.start_goodG2B_~data~1#1| 3) .cse8 .cse10 (<= |#NULL.offset| 0) .cse11 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse13 (<= 3 |ULTIMATE.start_goodG2B_~result~1#1|) .cse15 .cse16 (<= 0 ~globalFalse~0) (<= 0 ~globalArgc~0) .cse17 (<= 0 ~globalArgv~0.base) .cse18 (<= |#NULL.base| 0) .cse20 .cse21 (<= ~globalArgv~0.base 0) (<= ~GLOBAL_CONST_FALSE~0 0) .cse22 .cse23 (<= 0 ~globalArgv~0.offset) .cse24 .cse25 (<= |ULTIMATE.start_goodG2B_~j~0#1| 1) (<= 1 ~globalTrue~0) (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) (<= 0 |#NULL.offset|) (<= ~globalFive~0 5) .cse31 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (and .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 .cse35 .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33))) [2022-12-14 09:10:31,602 INFO L899 garLoopResultBuilder]: For program point L1576-3(line 1576) no Hoare annotation was computed. [2022-12-14 09:10:31,603 INFO L899 garLoopResultBuilder]: For program point L1576-4(line 1576) no Hoare annotation was computed. [2022-12-14 09:10:31,603 INFO L895 garLoopResultBuilder]: At program point L1576-5(lines 1576 1579) the Hoare annotation is: (let ((.cse37 (= |ULTIMATE.start_goodG2B_~data~1#1| 0)) (.cse38 (= |ULTIMATE.start_goodG2B_~h~0#1| 0)) (.cse8 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse9 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse11 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse12 (= (select (select |#memory_int| 1) 0) 0)) (.cse14 (= |ULTIMATE.start_goodG2B_~data~1#1| 2)) (.cse16 (= (select |#valid| 3) 1)) (.cse18 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse20 (= (select |#valid| 4) 1)) (.cse22 (= (select |#length| 3) 18)) (.cse23 (= (select |#valid| 1) 1)) (.cse24 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse25 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse26 (= (select |#valid| 0) 0)) (.cse27 (= 54 (select |#length| 2))) (.cse28 (= (select |#length| 1) 1)) (.cse29 (= (select |#valid| 2) 1)) (.cse30 (= 16 (select |#length| 4))) (.cse31 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse32 (= ~globalArgc~0 0)) (.cse34 (< 0 |#StackHeapBarrier|)) (.cse35 (= |#NULL.base| 0)) (.cse36 (= ~globalTrue~0 1)) (.cse0 (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|)) (.cse1 (<= ~globalFalse~0 0)) (.cse2 (<= |#NULL.offset| 0)) (.cse3 (<= 0 ~globalFalse~0)) (.cse4 (<= 0 ~globalArgv~0.base)) (.cse5 (<= ~globalArgv~0.base 0)) (.cse6 (<= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse7 (<= 0 |#NULL.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse13 (= ~globalArgv~0.offset 0)) (.cse15 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse21 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse39 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= 0 (+ 2147483647 .cse39)) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (<= .cse39 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse39) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0)))))) (.cse33 (= 5 ~globalFive~0))) (or (and .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) (and .cse8 .cse10 .cse11 .cse12 .cse13 .cse37 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse38 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36)))) (and (<= 5 ~globalFive~0) (let ((.cse40 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse41 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= .cse41 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (<= 2147483647 .cse41) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0))))))) (or (and .cse8 .cse10 .cse11 .cse12 .cse40 .cse37 .cse16 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse38 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse40 .cse16 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36))) (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) .cse0 .cse1 (<= ~GLOBAL_CONST_FIVE~0 5) .cse2 (<= 1 ~GLOBAL_CONST_TRUE~0) .cse3 .cse4 .cse5 (<= 0 ~globalArgv~0.offset) .cse6 .cse7 (<= ~globalFive~0 5)))) [2022-12-14 09:10:31,604 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-12-14 09:10:31,604 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~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 (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |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 |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-12-14 09:10:31,604 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-12-14 09:10:31,604 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-12-14 09:10:31,605 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_goodG2B_~h~0#1| 1)) (.cse2 (= |ULTIMATE.start_goodG2B_~j~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse5 (= (select (select |#memory_int| 1) 0) 0)) (.cse6 (= ~globalArgv~0.offset 0)) (.cse8 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse9 (= (select |#valid| 3) 1)) (.cse10 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse13 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse14 (= (select |#valid| 4) 1)) (.cse15 (<= 3 |ULTIMATE.start_goodG2B_~result~1#1|)) (.cse16 (= (select |#length| 3) 18)) (.cse17 (= (select |#valid| 1) 1)) (.cse18 (<= |ULTIMATE.start_goodG2B_~result~1#1| 3)) (.cse19 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse20 (= ~globalArgv~0.base 0)) (.cse21 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse22 (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|)) (.cse23 (= (select |#valid| 0) 0)) (.cse24 (= 54 (select |#length| 2))) (.cse25 (= (select |#length| 1) 1)) (.cse26 (= (select |#valid| 2) 1)) (.cse27 (= 16 (select |#length| 4))) (.cse28 (= |#NULL.offset| 0)) (.cse29 (= ~globalFalse~0 0)) (.cse30 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse31 (= ~globalArgc~0 0)) (.cse32 (= 5 ~globalFive~0)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= |#NULL.base| 0)) (.cse35 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| Int)) (let ((.cse7 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0))) (and (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (<= .cse7 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 0) (<= 2147483647 .cse7) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) 4) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_19| 0))))) .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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| Int)) (let ((.cse36 (select (select |#memory_int| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0))) (and (not (= 3 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (< |#StackHeapBarrier| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (<= 0 (+ 2147483647 .cse36)) (not (= 4 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (= (select |#length| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 4) (<= .cse36 2147483647) (= (select |#valid| |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) 0) (<= 0 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|) (= |ULTIMATE.start_goodB2G_~result~0#1| .cse36) (not (= 2 |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20|)) (not (= |v_ULTIMATE.start_goodB2G_~#data~0#1.base_20| 0))))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35))) [2022-12-14 09:10:31,605 INFO L899 garLoopResultBuilder]: For program point L1585-1(lines 1580 1587) no Hoare annotation was computed. [2022-12-14 09:10:31,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-12-14 09:10:31,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-12-14 09:10:31,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 09:10:31,605 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-12-14 09:10:31,605 INFO L899 garLoopResultBuilder]: For program point L1561(line 1561) no Hoare annotation was computed. [2022-12-14 09:10:31,605 INFO L899 garLoopResultBuilder]: For program point L1561-1(line 1561) no Hoare annotation was computed. [2022-12-14 09:10:31,606 INFO L899 garLoopResultBuilder]: For program point L1557-2(line 1557) no Hoare annotation was computed. [2022-12-14 09:10:31,606 INFO L899 garLoopResultBuilder]: For program point L1557-3(line 1557) no Hoare annotation was computed. [2022-12-14 09:10:31,606 INFO L895 garLoopResultBuilder]: At program point L1557-4(lines 1557 1569) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= ~globalArgv~0.offset 0)) (.cse6 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse11 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse13 (= (select |#valid| 4) 1)) (.cse14 (= (select |#length| 3) 18)) (.cse15 (= (select |#valid| 1) 1)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse17 (= ~globalArgv~0.base 0)) (.cse18 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse19 (= (select |#valid| 0) 0)) (.cse20 (= 54 (select |#length| 2))) (.cse21 (= (select |#length| 1) 1)) (.cse22 (= (select |#valid| 2) 1)) (.cse23 (= 16 (select |#length| 4))) (.cse24 (= |#NULL.offset| 0)) (.cse25 (= ~globalFalse~0 0)) (.cse26 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse27 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|)) (.cse28 (= ~globalArgc~0 0)) (.cse29 (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1)) (.cse30 (= 5 ~globalFive~0)) (.cse31 (= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0)) (.cse32 (<= .cse12 2147483647)) (.cse33 (< 0 |#StackHeapBarrier|)) (.cse34 (= |#NULL.base| 0)) (.cse35 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_goodB2G_~result~0#1| .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= 0 (+ 2147483647 .cse12)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and (<= 0 (+ .cse12 2147483648)) .cse0 (= |ULTIMATE.start_goodB2G_~k~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 2147483647 .cse12) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-12-14 09:10:31,606 INFO L899 garLoopResultBuilder]: For program point L1553-3(line 1553) no Hoare annotation was computed. [2022-12-14 09:10:31,606 INFO L899 garLoopResultBuilder]: For program point L1553-4(line 1553) no Hoare annotation was computed. [2022-12-14 09:10:31,607 INFO L895 garLoopResultBuilder]: At program point L1553-5(lines 1553 1556) the Hoare annotation is: (and (let ((.cse0 (<= 0 ~GLOBAL_CONST_FALSE~0)) (.cse1 (<= ~globalTrue~0 1)) (.cse2 (<= ~globalArgc~0 0)) (.cse3 (<= 0 |#NULL.base|)) (.cse4 (<= 5 ~globalFive~0)) (.cse5 (<= 5 ~GLOBAL_CONST_FIVE~0)) (.cse6 (<= ~GLOBAL_CONST_TRUE~0 1)) (.cse7 (<= ~globalArgv~0.offset 0)) (.cse8 (<= ~globalFalse~0 0)) (.cse9 (<= ~GLOBAL_CONST_FIVE~0 5)) (.cse10 (<= |#NULL.offset| 0)) (.cse11 (<= 1 ~GLOBAL_CONST_TRUE~0)) (.cse12 (<= |ULTIMATE.start_goodB2G_~#data~0#1.offset| 0)) (.cse13 (<= 0 ~globalFalse~0)) (.cse14 (<= 0 ~globalArgc~0)) (.cse15 (<= 0 ~globalArgv~0.base)) (.cse16 (<= |#NULL.base| 0)) (.cse17 (<= ~globalArgv~0.base 0)) (.cse18 (<= ~GLOBAL_CONST_FALSE~0 0)) (.cse19 (<= 0 ~globalArgv~0.offset)) (.cse20 (<= 1 ~globalTrue~0)) (.cse21 (<= 0 |#NULL.offset|)) (.cse22 (<= ~globalFive~0 5)) (.cse23 (<= 0 |ULTIMATE.start_goodB2G_~#data~0#1.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 0 |ULTIMATE.start_goodB2G_~i~1#1|) .cse13 .cse14 (<= |ULTIMATE.start_goodB2G_~i~1#1| 0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1)))) (let ((.cse25 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse26 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse27 (= (select |#length| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 4)) (.cse28 (= (select (select |#memory_int| 1) 0) 0)) (.cse24 (select (select |#memory_int| |ULTIMATE.start_goodB2G_~#data~0#1.base|) |ULTIMATE.start_goodB2G_~#data~0#1.offset|)) (.cse29 (= (select |#valid| 3) 1)) (.cse30 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse31 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse32 (= (select |#valid| 4) 1)) (.cse33 (= (select |#length| 3) 18)) (.cse34 (= (select |#valid| 1) 1)) (.cse35 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse36 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse37 (= (select |#valid| 0) 0)) (.cse38 (= 54 (select |#length| 2))) (.cse39 (= (select |#length| 1) 1)) (.cse40 (= (select |#valid| 2) 1)) (.cse41 (= 16 (select |#length| 4))) (.cse42 (< |#StackHeapBarrier| |ULTIMATE.start_goodB2G_~#data~0#1.base|)) (.cse43 (= (select |#valid| |ULTIMATE.start_goodB2G_~#data~0#1.base|) 1)) (.cse44 (< 0 |#StackHeapBarrier|))) (or (and (<= 0 (+ .cse24 2147483648)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse42 .cse43 (<= .cse24 2147483647) .cse44) (and .cse25 .cse26 .cse27 .cse28 (= .cse24 0) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44)))) [2022-12-14 09:10:31,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-12-14 09:10:31,607 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 09:10:31,607 INFO L902 garLoopResultBuilder]: At program point L1599(line 1599) the Hoare annotation is: true [2022-12-14 09:10:31,607 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-12-14 09:10:31,607 INFO L902 garLoopResultBuilder]: At program point L1599-1(line 1599) the Hoare annotation is: true [2022-12-14 09:10:31,608 INFO L899 garLoopResultBuilder]: For program point L1583(line 1583) no Hoare annotation was computed. [2022-12-14 09:10:31,608 INFO L899 garLoopResultBuilder]: For program point L1583-1(line 1583) no Hoare annotation was computed. [2022-12-14 09:10:31,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-12-14 09:10:31,608 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-12-14 09:10:31,611 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:10:31,613 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 09:10:31,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,631 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,632 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,644 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,645 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,645 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,645 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,645 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,645 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,646 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,647 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,647 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,647 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,647 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,647 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,648 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,649 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,649 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,649 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,649 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,650 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,651 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,651 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,651 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,652 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,653 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,653 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,653 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,657 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,657 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,658 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,658 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,658 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,658 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,658 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,659 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,659 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,659 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,659 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,659 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,660 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,660 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,660 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,660 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,660 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,661 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,661 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,661 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,661 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,661 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,662 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,662 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,662 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,662 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,663 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,664 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,665 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,666 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,669 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,669 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,669 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,669 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,670 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,670 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,670 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,670 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,670 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,671 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,672 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,673 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,674 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,675 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,676 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,677 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 09:10:31 BoogieIcfgContainer [2022-12-14 09:10:31,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 09:10:31,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 09:10:31,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 09:10:31,687 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 09:10:31,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:10:09" (3/4) ... [2022-12-14 09:10:31,690 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 09:10:31,695 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-14 09:10:31,695 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-14 09:10:31,699 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-12-14 09:10:31,699 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-12-14 09:10:31,699 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 09:10:31,700 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 09:10:31,723 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= i) && 0 <= globalFalse) && 0 <= globalArgc) && i <= 0) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) || (((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1)) && (((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((((argv == argv && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && unknown-#memory_int-unknown[data][data] == 0) && \valid[3] == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown)) [2022-12-14 09:10:31,723 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && result == unknown-#memory_int-unknown[data][data]) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && 0 <= 2147483647 + unknown-#memory_int-unknown[data][data]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && GLOBAL_CONST_FALSE == 0) && k == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && 2147483647 <= unknown-#memory_int-unknown[data][data]) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) [2022-12-14 09:10:31,723 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= k && globalFalse <= 0) && #NULL <= 0) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && k <= 1) && 0 <= #NULL) && (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) || ((((((((((((((((5 <= globalFive && (((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && data == 0) && \valid[3] == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && data == 2) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[3] == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && 0 <= globalArgv) && k <= 1) && 0 <= #NULL) && globalFive <= 5) [2022-12-14 09:10:31,724 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 3 <= data) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && result <= 3) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && h <= 1) && 5 <= globalFive) && argv == argv) && argc == \old(argc)) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= j) && 1 <= h) && 1 <= k) && unknown-#memory_int-unknown[1][0] == 0) && globalFalse <= 0) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && 3 <= data) && GLOBAL_CONST_FIVE <= 5) && data <= 3) && \valid[3] == 1) && argv == #in~argv) && #NULL <= 0) && argv == argv) && 1 <= GLOBAL_CONST_TRUE) && \valid[4] == 1) && 3 <= result) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && 0 <= globalFalse) && 0 <= globalArgc) && result <= 3) && 0 <= globalArgv) && argv == #in~argv) && #NULL <= 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && 0 <= globalArgv) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && j <= 1) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 < unknown-#StackHeapBarrier-unknown) && i <= 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) [2022-12-14 09:10:31,738 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 09:10:31,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 09:10:31,738 INFO L158 Benchmark]: Toolchain (without parser) took 23925.03ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 123.4MB in the beginning and 183.5MB in the end (delta: -60.1MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2022-12-14 09:10:31,739 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:10:31,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 859.53ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 122.8MB in the beginning and 187.9MB in the end (delta: -65.2MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2022-12-14 09:10:31,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.17ms. Allocated memory is still 222.3MB. Free memory was 187.9MB in the beginning and 184.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 09:10:31,739 INFO L158 Benchmark]: Boogie Preprocessor took 21.32ms. Allocated memory is still 222.3MB. Free memory was 184.8MB in the beginning and 183.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 09:10:31,740 INFO L158 Benchmark]: RCFGBuilder took 327.09ms. Allocated memory is still 222.3MB. Free memory was 183.7MB in the beginning and 164.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 09:10:31,740 INFO L158 Benchmark]: TraceAbstraction took 22623.41ms. Allocated memory is still 222.3MB. Free memory was 164.9MB in the beginning and 58.2MB in the end (delta: 106.7MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. [2022-12-14 09:10:31,740 INFO L158 Benchmark]: Witness Printer took 51.71ms. Allocated memory is still 222.3MB. Free memory was 58.2MB in the beginning and 183.5MB in the end (delta: -125.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-12-14 09:10:31,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 106.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 859.53ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 122.8MB in the beginning and 187.9MB in the end (delta: -65.2MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.17ms. Allocated memory is still 222.3MB. Free memory was 187.9MB in the beginning and 184.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.32ms. Allocated memory is still 222.3MB. Free memory was 184.8MB in the beginning and 183.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 327.09ms. Allocated memory is still 222.3MB. Free memory was 183.7MB in the beginning and 164.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22623.41ms. Allocated memory is still 222.3MB. Free memory was 164.9MB in the beginning and 58.2MB in the end (delta: 106.7MB). Peak memory consumption was 111.4MB. Max. memory is 16.1GB. * Witness Printer took 51.71ms. Allocated memory is still 222.3MB. Free memory was 58.2MB in the beginning and 183.5MB in the end (delta: -125.3MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] * 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: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: 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 3 procedures, 44 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 1087 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 685 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1191 IncrementalHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 402 mSDtfsCounter, 1191 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 253 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 31 PreInvPairs, 50 NumberOfFragments, 3020 HoareAnnotationTreeSize, 31 FomulaSimplifications, 66 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 4567 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 838 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1034 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 104/122 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: 3.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 64, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 104, TOOLS_POST_TIME: 1.9s, TOOLS_POST_CALL_APPLICATIONS: 26, TOOLS_POST_CALL_TIME: 0.4s, TOOLS_POST_RETURN_APPLICATIONS: 20, TOOLS_POST_RETURN_TIME: 0.2s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 142, TOOLS_QUANTIFIERELIM_TIME: 2.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 224, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 36, DOMAIN_JOIN_TIME: 0.4s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 64, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 0.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 20, CALL_SUMMARIZER_CACHE_MISSES: 4, 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.0s, DAG_COMPRESSION_PROCESSED_NODES: 3001, DAG_COMPRESSION_RETAINED_NODES: 230, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1576]: Loop Invariant [2022-12-14 09:10:31,750 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,750 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,751 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,752 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,753 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,753 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,753 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,753 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,753 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,753 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,754 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,754 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,754 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,754 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,754 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,755 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,756 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,757 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,758 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,758 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,758 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,760 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,760 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,760 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,761 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,761 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,761 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,761 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,761 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,761 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,762 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,762 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,762 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,762 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,762 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,763 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,764 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,764 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,764 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,764 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,765 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,765 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,765 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,765 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,765 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,766 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,766 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,766 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,766 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,767 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,767 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,767 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,767 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,768 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,768 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,768 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,768 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] Derived loop invariant: ((((((((1 <= k && globalFalse <= 0) && #NULL <= 0) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && k <= 1) && 0 <= #NULL) && (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) || ((((((((((((((((5 <= globalFive && (((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && data == 0) && \valid[3] == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && data == 2) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && \valid[3] == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && globalArgc == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1))) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= k) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && 0 <= globalFalse) && 0 <= globalArgv) && globalArgv <= 0) && 0 <= globalArgv) && k <= 1) && 0 <= #NULL) && globalFive <= 5) - InvariantResult [Line: 1580]: Loop Invariant [2022-12-14 09:10:31,770 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,771 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,772 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,772 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,772 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,772 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,772 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,774 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,774 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,774 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,774 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,774 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,777 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,777 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,777 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,777 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,777 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,779 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,784 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20,QUANTIFIED] [2022-12-14 09:10:31,785 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,785 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,785 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,785 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,786 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,786 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,786 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,786 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,786 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,787 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,787 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,787 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,787 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,788 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,788 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,788 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,788 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,788 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] [2022-12-14 09:10:31,789 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && j == 1) && 3 <= data) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && result <= 3) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && result == data) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 : int :: (((((((((!(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && 0 <= 2147483647 + unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 4) && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20] == 0) && 0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_20) && result == unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_20][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_20)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_20 == 0))) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && h <= 1) && 5 <= globalFive) && argv == argv) && argc == \old(argc)) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= j) && 1 <= h) && 1 <= k) && unknown-#memory_int-unknown[1][0] == 0) && globalFalse <= 0) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && 3 <= data) && GLOBAL_CONST_FIVE <= 5) && data <= 3) && \valid[3] == 1) && argv == #in~argv) && #NULL <= 0) && argv == argv) && 1 <= GLOBAL_CONST_TRUE) && \valid[4] == 1) && 3 <= result) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && 0 <= globalFalse) && 0 <= globalArgc) && result <= 3) && 0 <= globalArgv) && argv == #in~argv) && #NULL <= 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && 0 <= globalArgv) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && j <= 1) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 < unknown-#StackHeapBarrier-unknown) && i <= 1)) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 2) && (\exists v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 : int :: ((((((((0 <= v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 && unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0] <= 2147483647) && \valid[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 0) && 2147483647 <= unknown-#memory_int-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19][0]) && !(2 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && unknown-#length-unknown[v_ULTIMATE.start_goodB2G_~#data~0#1.base_19] == 4) && unknown-#StackHeapBarrier-unknown < v_ULTIMATE.start_goodB2G_~#data~0#1.base_19) && !(4 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(3 == v_ULTIMATE.start_goodB2G_~#data~0#1.base_19)) && !(v_ULTIMATE.start_goodB2G_~#data~0#1.base_19 == 0))) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) - InvariantResult [Line: 1599]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= i) && 0 <= globalFalse) && 0 <= globalArgc) && i <= 0) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) || (((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && 5 <= globalFive) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && #NULL <= 0) && 1 <= GLOBAL_CONST_TRUE) && data <= 0) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && #NULL <= 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 0 <= globalArgv) && 1 <= globalTrue) && 0 <= #NULL) && globalFive <= 5) && 0 <= data) && i <= 1)) && (((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && \valid[3] == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) || ((((((((((((((((((((argv == argv && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && unknown-#memory_int-unknown[data][data] == 0) && \valid[3] == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && unknown-#StackHeapBarrier-unknown < data) && \valid[data] == 1) && 0 < unknown-#StackHeapBarrier-unknown)) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && result == unknown-#memory_int-unknown[data][data]) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && 0 <= 2147483647 + unknown-#memory_int-unknown[data][data]) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((((((((0 <= unknown-#memory_int-unknown[data][data] + 2147483648 && GLOBAL_CONST_FALSE == 0) && k == 0) && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) || (((((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#length-unknown[data] == 4) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && 2147483647 <= unknown-#memory_int-unknown[data][data]) && globalFalse == 0) && i == 1) && unknown-#StackHeapBarrier-unknown < data) && globalArgc == 0) && \valid[data] == 1) && 5 == globalFive) && data == 0) && unknown-#memory_int-unknown[data][data] <= 2147483647) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) RESULT: Ultimate proved your program to be correct! [2022-12-14 09:10:31,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76a9f201-ddbd-4247-bca4-a9aa3aa65cf0/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