./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fcff98ef51e3b09131273b34f1e7e992e7f5c9a8509de788567aa68bc3d1cb7e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:16:31,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:16:31,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:16:31,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:16:31,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:16:31,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:16:31,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:16:31,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:16:31,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:16:31,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:16:31,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:16:31,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:16:31,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:16:31,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:16:31,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:16:31,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:16:31,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:16:31,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:16:31,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:16:31,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:16:31,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:16:31,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:16:31,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:16:31,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:16:31,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:16:31,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:16:31,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:16:31,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:16:31,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:16:31,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:16:31,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:16:31,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:16:31,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:16:31,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:16:31,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:16:31,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:16:31,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:16:31,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:16:31,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:16:31,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:16:31,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:16:31,688 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-25 22:16:31,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:16:31,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:16:31,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:16:31,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:16:31,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:16:31,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:16:31,716 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:16:31,716 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:16:31,717 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:16:31,717 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:16:31,717 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:16:31,717 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:16:31,718 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:16:31,718 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:16:31,718 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:16:31,718 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:16:31,719 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:16:31,719 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:16:31,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:16:31,720 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:16:31,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:16:31,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:16:31,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:16:31,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:16:31,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:16:31,722 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 22:16:31,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:16:31,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:16:31,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:16:31,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:16:31,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:16:31,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:16:31,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:16:31,724 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:16:31,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:16:31,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:16:31,724 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:16:31,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:16:31,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:16:31,725 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:16:31,725 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_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcff98ef51e3b09131273b34f1e7e992e7f5c9a8509de788567aa68bc3d1cb7e [2022-11-25 22:16:31,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:16:32,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:16:32,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:16:32,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:16:32,037 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:16:32,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_good.i [2022-11-25 22:16:35,088 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:16:35,462 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:16:35,463 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_sub_11_good.i [2022-11-25 22:16:35,485 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/data/667725272/a083a2de22c541c3b21a2aefb0844dc9/FLAG8a0d66b14 [2022-11-25 22:16:35,501 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/data/667725272/a083a2de22c541c3b21a2aefb0844dc9 [2022-11-25 22:16:35,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:16:35,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:16:35,507 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:16:35,507 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:16:35,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:16:35,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:16:35" (1/1) ... [2022-11-25 22:16:35,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea09d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:35, skipping insertion in model container [2022-11-25 22:16:35,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:16:35" (1/1) ... [2022-11-25 22:16:35,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:16:35,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:16:35,981 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 22:16:36,515 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 22:16:36,528 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 22:16:36,532 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 22:16:36,539 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 22:16:36,540 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 22:16:36,598 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 22:16:36,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:16:36,613 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:16:36,655 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 22:16:36,751 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 22:16:36,753 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 22:16:36,754 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 22:16:36,757 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 22:16:36,758 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 22:16:36,777 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 22:16:36,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:16:36,895 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:16:36,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36 WrapperNode [2022-11-25 22:16:36,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:16:36,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:16:36,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:16:36,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:16:36,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:36,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:36,971 INFO L138 Inliner]: procedures = 503, calls = 77, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-11-25 22:16:36,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:16:36,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:16:36,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:16:36,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:16:36,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:36,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:36,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:36,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:36,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:37,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:37,003 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:37,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:37,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:16:37,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:16:37,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:16:37,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:16:37,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (1/1) ... [2022-11-25 22:16:37,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:16:37,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:37,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:16:37,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:16:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 22:16:37,094 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 22:16:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 22:16:37,094 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 22:16:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsTrue [2022-11-25 22:16:37,095 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsTrue [2022-11-25 22:16:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:16:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:16:37,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:16:37,095 INFO L130 BoogieDeclarations]: Found specification of procedure globalReturnsFalse [2022-11-25 22:16:37,096 INFO L138 BoogieDeclarations]: Found implementation of procedure globalReturnsFalse [2022-11-25 22:16:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 22:16:37,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:16:37,246 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:16:37,248 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:16:37,674 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:16:37,899 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:16:37,899 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:16:37,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:16:37 BoogieIcfgContainer [2022-11-25 22:16:37,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:16:37,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:16:37,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:16:37,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:16:37,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:16:35" (1/3) ... [2022-11-25 22:16:37,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc908fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:16:37, skipping insertion in model container [2022-11-25 22:16:37,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:16:36" (2/3) ... [2022-11-25 22:16:37,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc908fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:16:37, skipping insertion in model container [2022-11-25 22:16:37,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:16:37" (3/3) ... [2022-11-25 22:16:37,916 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_sub_11_good.i [2022-11-25 22:16:37,936 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:16:37,937 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 22:16:37,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:16:38,005 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;@6c96581f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:16:38,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 22:16:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 49 states have internal predecessors, (49), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 22:16:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:16:38,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:38,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:38,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:38,026 INFO L85 PathProgramCache]: Analyzing trace with hash -760081410, now seen corresponding path program 1 times [2022-11-25 22:16:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:38,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596086946] [2022-11-25 22:16:38,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:16:38,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596086946] [2022-11-25 22:16:38,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596086946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:38,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:16:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242898013] [2022-11-25 22:16:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:38,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:16:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:38,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:16:38,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:16:38,471 INFO L87 Difference]: Start difference. First operand has 65 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 49 states have internal predecessors, (49), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:16:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:38,581 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2022-11-25 22:16:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:16:38,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 16 [2022-11-25 22:16:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:38,598 INFO L225 Difference]: With dead ends: 106 [2022-11-25 22:16:38,598 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 22:16:38,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:16:38,607 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:38,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 149 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:16:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 22:16:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2022-11-25 22:16:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.375) internal successors, (44), 44 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 22:16:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-11-25 22:16:38,667 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 16 [2022-11-25 22:16:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:38,668 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-11-25 22:16:38,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:16:38,668 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-11-25 22:16:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:16:38,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:38,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:38,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:16:38,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:38,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2087687154, now seen corresponding path program 1 times [2022-11-25 22:16:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:38,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880527140] [2022-11-25 22:16:38,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:16:39,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:39,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880527140] [2022-11-25 22:16:39,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880527140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:39,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:39,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:16:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644780606] [2022-11-25 22:16:39,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:39,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:16:39,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:39,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:16:39,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:16:39,043 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:16:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:39,162 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-25 22:16:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:16:39,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2022-11-25 22:16:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:39,165 INFO L225 Difference]: With dead ends: 59 [2022-11-25 22:16:39,165 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 22:16:39,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:16:39,167 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:39,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 198 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:16:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 22:16:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 22:16:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.34375) internal successors, (43), 43 states have internal predecessors, (43), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 22:16:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-11-25 22:16:39,176 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 17 [2022-11-25 22:16:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:39,177 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-11-25 22:16:39,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:16:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-11-25 22:16:39,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 22:16:39,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:39,178 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:39,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:16:39,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:39,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash 546335334, now seen corresponding path program 1 times [2022-11-25 22:16:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:39,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242406964] [2022-11-25 22:16:39,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 22:16:39,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:39,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242406964] [2022-11-25 22:16:39,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242406964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:39,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:39,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:16:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512438132] [2022-11-25 22:16:39,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:39,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:16:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:39,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:16:39,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:16:39,328 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 22:16:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:39,389 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-11-25 22:16:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:16:39,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 29 [2022-11-25 22:16:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:39,391 INFO L225 Difference]: With dead ends: 102 [2022-11-25 22:16:39,391 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 22:16:39,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:16:39,393 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:39,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:16:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 22:16:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 22:16:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.3125) internal successors, (42), 42 states have internal predecessors, (42), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 22:16:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-11-25 22:16:39,402 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 29 [2022-11-25 22:16:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:39,403 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-11-25 22:16:39,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-25 22:16:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-11-25 22:16:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 22:16:39,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:39,405 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:39,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:16:39,405 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:39,406 INFO L85 PathProgramCache]: Analyzing trace with hash 492286548, now seen corresponding path program 1 times [2022-11-25 22:16:39,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:39,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987839787] [2022-11-25 22:16:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:39,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 22:16:39,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:39,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987839787] [2022-11-25 22:16:39,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987839787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:39,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:39,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:16:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470537931] [2022-11-25 22:16:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:39,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:16:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:39,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:16:39,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:16:39,466 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 22:16:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:39,505 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-11-25 22:16:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:16:39,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 30 [2022-11-25 22:16:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:39,507 INFO L225 Difference]: With dead ends: 80 [2022-11-25 22:16:39,507 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 22:16:39,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:16:39,508 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:39,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 150 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:16:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 22:16:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2022-11-25 22:16:39,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.28125) internal successors, (41), 41 states have internal predecessors, (41), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 22:16:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-11-25 22:16:39,517 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 30 [2022-11-25 22:16:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:39,518 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-11-25 22:16:39,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 22:16:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-11-25 22:16:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 22:16:39,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:39,520 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:39,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:16:39,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:39,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1918986087, now seen corresponding path program 1 times [2022-11-25 22:16:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:39,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269493154] [2022-11-25 22:16:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:39,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 22:16:39,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:39,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269493154] [2022-11-25 22:16:39,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269493154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:39,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:39,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:16:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662188796] [2022-11-25 22:16:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:39,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:16:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:16:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:16:39,794 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 22:16:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:39,853 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-11-25 22:16:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:16:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 31 [2022-11-25 22:16:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:39,855 INFO L225 Difference]: With dead ends: 56 [2022-11-25 22:16:39,855 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 22:16:39,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:16:39,857 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:39,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:16:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 22:16:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 22:16:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.25) internal successors, (40), 40 states have internal predecessors, (40), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 22:16:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-11-25 22:16:39,867 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 31 [2022-11-25 22:16:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:39,868 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-11-25 22:16:39,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 22:16:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-11-25 22:16:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 22:16:39,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:39,870 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:39,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:16:39,870 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:39,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1350336792, now seen corresponding path program 1 times [2022-11-25 22:16:39,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:39,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693495011] [2022-11-25 22:16:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:39,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 22:16:40,008 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:40,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693495011] [2022-11-25 22:16:40,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693495011] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:16:40,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278962337] [2022-11-25 22:16:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:40,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:40,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:40,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:16:40,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:16:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:40,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:16:40,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 22:16:40,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:40,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278962337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:40,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:16:40,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-25 22:16:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038572360] [2022-11-25 22:16:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:40,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:16:40,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:40,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:16:40,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:16:40,223 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 22:16:40,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:40,257 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-11-25 22:16:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:16:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 40 [2022-11-25 22:16:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:40,259 INFO L225 Difference]: With dead ends: 55 [2022-11-25 22:16:40,259 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 22:16:40,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:16:40,260 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:40,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:16:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 22:16:40,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 22:16:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 39 states have internal predecessors, (39), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 22:16:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-25 22:16:40,271 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 40 [2022-11-25 22:16:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:40,271 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-25 22:16:40,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 22:16:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-25 22:16:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 22:16:40,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:40,273 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:40,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:40,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 22:16:40,480 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:40,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1089232544, now seen corresponding path program 1 times [2022-11-25 22:16:40,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:40,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126077814] [2022-11-25 22:16:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 22:16:40,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:40,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126077814] [2022-11-25 22:16:40,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126077814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:16:40,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566912472] [2022-11-25 22:16:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:40,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:40,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:16:40,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 22:16:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:40,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:16:40,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 22:16:40,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:40,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566912472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:40,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:16:40,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-25 22:16:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075569363] [2022-11-25 22:16:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:40,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:16:40,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:16:40,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:16:40,825 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 22:16:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:40,862 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-11-25 22:16:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:16:40,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 41 [2022-11-25 22:16:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:40,864 INFO L225 Difference]: With dead ends: 71 [2022-11-25 22:16:40,864 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 22:16:40,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:16:40,865 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 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-11-25 22:16:40,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:16:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 22:16:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-11-25 22:16:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 42 states have internal predecessors, (44), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 22:16:40,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-11-25 22:16:40,875 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 41 [2022-11-25 22:16:40,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:40,875 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-11-25 22:16:40,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 22:16:40,875 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-11-25 22:16:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 22:16:40,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:40,877 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:40,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:41,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:41,083 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:41,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1121653809, now seen corresponding path program 1 times [2022-11-25 22:16:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:41,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69476636] [2022-11-25 22:16:41,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 22:16:41,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:41,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69476636] [2022-11-25 22:16:41,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69476636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:16:41,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050328711] [2022-11-25 22:16:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:41,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:41,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:41,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:16:41,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 22:16:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:41,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 22:16:41,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-25 22:16:41,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:41,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050328711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:41,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:16:41,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-11-25 22:16:41,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158315273] [2022-11-25 22:16:41,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:41,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:16:41,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:41,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:16:41,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:16:41,372 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 22:16:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:41,415 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-25 22:16:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:16:41,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 44 [2022-11-25 22:16:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:41,418 INFO L225 Difference]: With dead ends: 59 [2022-11-25 22:16:41,418 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 22:16:41,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:16:41,423 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:41,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:16:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 22:16:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-11-25 22:16:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 38 states have internal predecessors, (38), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 22:16:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-25 22:16:41,439 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 44 [2022-11-25 22:16:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:41,439 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-25 22:16:41,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 22:16:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-25 22:16:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 22:16:41,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:41,441 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:41,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:41,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:41,647 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:41,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2066208952, now seen corresponding path program 1 times [2022-11-25 22:16:41,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:41,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245782648] [2022-11-25 22:16:41,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:41,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-25 22:16:41,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:41,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245782648] [2022-11-25 22:16:41,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245782648] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:16:41,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157672931] [2022-11-25 22:16:41,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:41,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:41,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:41,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:16:41,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 22:16:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:41,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:16:41,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 22:16:41,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:41,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157672931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:41,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:16:41,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 22:16:41,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053816057] [2022-11-25 22:16:41,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:41,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:16:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:41,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:16:41,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:16:41,934 INFO L87 Difference]: Start difference. First operand 53 states and 68 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 22:16:41,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:41,991 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-25 22:16:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:16:41,992 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 50 [2022-11-25 22:16:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:41,995 INFO L225 Difference]: With dead ends: 82 [2022-11-25 22:16:41,996 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 22:16:41,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:16:41,999 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:41,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:16:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 22:16:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 22:16:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.15625) internal successors, (37), 37 states have internal predecessors, (37), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 22:16:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-25 22:16:42,009 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 50 [2022-11-25 22:16:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:42,009 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-25 22:16:42,009 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-25 22:16:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-25 22:16:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 22:16:42,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:42,015 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:42,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:42,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:42,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:42,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 831465148, now seen corresponding path program 1 times [2022-11-25 22:16:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:42,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392230824] [2022-11-25 22:16:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 22:16:42,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:42,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392230824] [2022-11-25 22:16:42,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392230824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:16:42,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937830874] [2022-11-25 22:16:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:42,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:42,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:42,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:16:42,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 22:16:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:42,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:16:42,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 22:16:42,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:42,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937830874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:42,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 22:16:42,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-25 22:16:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213976486] [2022-11-25 22:16:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:42,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:16:42,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:16:42,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:16:42,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:16:42,482 INFO L87 Difference]: Start difference. First operand 53 states and 67 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 22:16:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:42,528 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-11-25 22:16:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:16:42,529 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2022-11-25 22:16:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:42,530 INFO L225 Difference]: With dead ends: 65 [2022-11-25 22:16:42,530 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 22:16:42,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:16:42,531 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:42,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:16:42,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 22:16:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 22:16:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-25 22:16:42,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-11-25 22:16:42,538 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 54 [2022-11-25 22:16:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:42,539 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-11-25 22:16:42,539 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 22:16:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-11-25 22:16:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 22:16:42,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:42,540 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:16:42,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:42,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 22:16:42,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:16:42,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -863156996, now seen corresponding path program 1 times [2022-11-25 22:16:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:16:42,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004321645] [2022-11-25 22:16:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:16:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 22:16:42,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:16:42,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004321645] [2022-11-25 22:16:42,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004321645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:16:42,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517124519] [2022-11-25 22:16:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:42,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:42,866 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:16:42,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 22:16:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:43,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:16:43,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 22:16:43,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:16:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 22:16:43,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517124519] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:16:43,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [258663110] [2022-11-25 22:16:43,192 INFO L159 IcfgInterpreter]: Started Sifa with 44 locations of interest [2022-11-25 22:16:43,192 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:16:43,196 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:16:43,202 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:16:43,203 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:16:48,085 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 99 for LOIs [2022-11-25 22:16:48,102 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 32 for LOIs [2022-11-25 22:16:48,105 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 99 for LOIs [2022-11-25 22:16:48,121 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 63 for LOIs [2022-11-25 22:16:48,136 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:17:00,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [258663110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:17:00,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:17:00,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [4, 4, 4] total 37 [2022-11-25 22:17:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619625700] [2022-11-25 22:17:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:17:00,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 22:17:00,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:17:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 22:17:00,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 22:17:00,957 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 22:17:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:17:12,464 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2022-11-25 22:17:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 22:17:12,465 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 59 [2022-11-25 22:17:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:17:12,466 INFO L225 Difference]: With dead ends: 128 [2022-11-25 22:17:12,466 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 22:17:12,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=339, Invalid=2013, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 22:17:12,468 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 125 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:17:12,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 365 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-25 22:17:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 22:17:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 60. [2022-11-25 22:17:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 40 states have internal predecessors, (41), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-11-25 22:17:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2022-11-25 22:17:12,490 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 59 [2022-11-25 22:17:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:17:12,491 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2022-11-25 22:17:12,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 22:17:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-11-25 22:17:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-25 22:17:12,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:17:12,497 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:17:12,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 22:17:12,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:17:12,704 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:17:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:17:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1443870672, now seen corresponding path program 1 times [2022-11-25 22:17:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:17:12,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894878927] [2022-11-25 22:17:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:17:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:17:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:17:12,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 22:17:12,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:17:12,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894878927] [2022-11-25 22:17:12,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894878927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:17:12,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757122514] [2022-11-25 22:17:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:17:12,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:17:12,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:17:12,830 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:17:12,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 22:17:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:17:12,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:17:12,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:17:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 22:17:13,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:17:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 22:17:13,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757122514] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:17:13,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [662742313] [2022-11-25 22:17:13,090 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-11-25 22:17:13,090 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:17:13,091 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:17:13,091 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:17:13,091 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:17:16,635 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 99 for LOIs [2022-11-25 22:17:16,646 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 67 for LOIs [2022-11-25 22:17:16,657 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 99 for LOIs [2022-11-25 22:17:16,673 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 113 for LOIs [2022-11-25 22:17:16,705 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:17:28,435 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 290 DAG size of output: 181 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:17:30,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [662742313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:17:30,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:17:30,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 38 [2022-11-25 22:17:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301331748] [2022-11-25 22:17:30,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:17:30,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 22:17:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:17:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 22:17:30,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 22:17:30,762 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 22:17:40,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:17:40,779 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-11-25 22:17:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 22:17:40,780 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 61 [2022-11-25 22:17:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:17:40,781 INFO L225 Difference]: With dead ends: 108 [2022-11-25 22:17:40,781 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 22:17:40,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 142 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=386, Invalid=2164, Unknown=0, NotChecked=0, Total=2550 [2022-11-25 22:17:40,784 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 65 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:17:40,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 342 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-25 22:17:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 22:17:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 22:17:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 22:17:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2022-11-25 22:17:40,805 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2022-11-25 22:17:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:17:40,805 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2022-11-25 22:17:40,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 22:17:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2022-11-25 22:17:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-25 22:17:40,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:17:40,807 INFO L195 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:17:40,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:17:41,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 22:17:41,008 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:17:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:17:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash 168025968, now seen corresponding path program 1 times [2022-11-25 22:17:41,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:17:41,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998062377] [2022-11-25 22:17:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:17:41,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:17:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:17:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 22:17:41,128 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:17:41,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998062377] [2022-11-25 22:17:41,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998062377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:17:41,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820468213] [2022-11-25 22:17:41,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:17:41,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:17:41,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:17:41,130 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:17:41,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 22:17:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:17:41,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:17:41,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:17:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 22:17:41,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:17:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-25 22:17:41,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820468213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:17:41,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [234196568] [2022-11-25 22:17:41,404 INFO L159 IcfgInterpreter]: Started Sifa with 46 locations of interest [2022-11-25 22:17:41,404 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:17:41,406 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:17:41,406 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:17:41,406 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:17:45,189 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 99 for LOIs [2022-11-25 22:17:45,205 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-25 22:17:45,208 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 99 for LOIs [2022-11-25 22:17:45,223 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 113 for LOIs [2022-11-25 22:17:45,254 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:17:55,427 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 207 DAG size of output: 141 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:19:04,877 WARN L233 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 206 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:20:15,065 WARN L233 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 210 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:21:37,920 WARN L233 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 221 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:21:43,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [234196568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:21:43,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:21:43,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 38 [2022-11-25 22:21:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311309825] [2022-11-25 22:21:43,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:21:43,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 22:21:43,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:21:43,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 22:21:43,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1288, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 22:21:43,615 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 22:21:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:21:55,916 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-11-25 22:21:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 22:21:55,917 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 61 [2022-11-25 22:21:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:21:55,918 INFO L225 Difference]: With dead ends: 99 [2022-11-25 22:21:55,918 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 22:21:55,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 142 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 246.4s TimeCoverageRelationStatistics Valid=361, Invalid=2089, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 22:21:55,920 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:21:55,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 201 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-25 22:21:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 22:21:55,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 22:21:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 36 states have internal predecessors, (36), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 22:21:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-11-25 22:21:55,945 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 61 [2022-11-25 22:21:55,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:21:55,946 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-11-25 22:21:55,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 21 states have (on average 1.380952380952381) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 22:21:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-11-25 22:21:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 22:21:55,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:21:55,947 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:21:55,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:21:56,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:21:56,159 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 22:21:56,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:21:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash 273253700, now seen corresponding path program 1 times [2022-11-25 22:21:56,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:21:56,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3733183] [2022-11-25 22:21:56,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:21:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:21:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:21:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 22:21:56,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:21:56,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3733183] [2022-11-25 22:21:56,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3733183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:21:56,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021335768] [2022-11-25 22:21:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:21:56,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:21:56,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:21:56,275 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:21:56,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 22:21:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:21:56,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:21:56,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:21:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 22:21:56,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:21:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-25 22:21:56,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021335768] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:21:56,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1968435316] [2022-11-25 22:21:56,535 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2022-11-25 22:21:56,535 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:21:56,535 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:21:56,535 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:21:56,536 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:22:00,137 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsTrue with input of size 99 for LOIs [2022-11-25 22:22:00,148 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 34 for LOIs [2022-11-25 22:22:00,151 INFO L197 IcfgInterpreter]: Interpreting procedure globalReturnsFalse with input of size 99 for LOIs [2022-11-25 22:22:00,161 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 77 for LOIs [2022-11-25 22:22:00,169 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:22:51,000 WARN L233 SmtUtils]: Spent 49.12s on a formula simplification. DAG size of input: 207 DAG size of output: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:23:25,344 WARN L233 SmtUtils]: Spent 28.75s on a formula simplification. DAG size of input: 215 DAG size of output: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:24:19,341 WARN L233 SmtUtils]: Spent 51.33s on a formula simplification. DAG size of input: 221 DAG size of output: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:25:25,910 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 297 DAG size of output: 187 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:25:28,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1968435316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:25:28,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:25:28,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [4, 4, 4] total 39 [2022-11-25 22:25:28,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082783375] [2022-11-25 22:25:28,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:25:28,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 22:25:28,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:25:28,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 22:25:28,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1350, Unknown=2, NotChecked=0, Total=1560 [2022-11-25 22:25:28,118 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 22:25:39,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:25:41,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:25:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:25:47,343 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-11-25 22:25:47,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 22:25:47,343 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 63 [2022-11-25 22:25:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:25:47,344 INFO L225 Difference]: With dead ends: 73 [2022-11-25 22:25:47,344 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 22:25:47,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 147 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 219.8s TimeCoverageRelationStatistics Valid=374, Invalid=2276, Unknown=2, NotChecked=0, Total=2652 [2022-11-25 22:25:47,346 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:25:47,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 52 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 694 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-11-25 22:25:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 22:25:47,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 22:25:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:25:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 22:25:47,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-11-25 22:25:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:25:47,348 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 22:25:47,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 22:25:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 22:25:47,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 22:25:47,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 22:25:47,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 22:25:47,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 22:25:47,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 22:25:47,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 22:25:47,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 22:25:47,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 22:25:47,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 22:25:47,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 22:25:47,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 22:25:47,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 22:25:58,518 WARN L233 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 392 DAG size of output: 307 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 22:26:06,903 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 397 DAG size of output: 310 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 22:26:14,733 WARN L233 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 427 DAG size of output: 384 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 22:26:22,582 WARN L233 SmtUtils]: Spent 7.84s on a formula simplification. DAG size of input: 398 DAG size of output: 311 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 22:26:38,937 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 395 DAG size of output: 308 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 22:26:47,561 WARN L233 SmtUtils]: Spent 8.59s on a formula simplification. DAG size of input: 410 DAG size of output: 262 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 22:26:53,334 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 22:26:53,335 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 22:26:53,335 INFO L902 garLoopResultBuilder]: At program point globalReturnsFalseENTRY(lines 1514 1517) the Hoare annotation is: true [2022-11-25 22:26:53,335 INFO L899 garLoopResultBuilder]: For program point globalReturnsFalseEXIT(lines 1514 1517) no Hoare annotation was computed. [2022-11-25 22:26:53,335 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 22:26:53,336 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 22:26:53,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1585) no Hoare annotation was computed. [2022-11-25 22:26:53,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1625) no Hoare annotation was computed. [2022-11-25 22:26:53,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1564) no Hoare annotation was computed. [2022-11-25 22:26:53,336 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 22:26:53,337 INFO L899 garLoopResultBuilder]: For program point L1564(line 1564) no Hoare annotation was computed. [2022-11-25 22:26:53,337 INFO L899 garLoopResultBuilder]: For program point L1564-1(line 1564) no Hoare annotation was computed. [2022-11-25 22:26:53,337 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-11-25 22:26:53,337 INFO L899 garLoopResultBuilder]: For program point L1622-1(lines 1622 1628) no Hoare annotation was computed. [2022-11-25 22:26:53,337 INFO L899 garLoopResultBuilder]: For program point L1556(line 1556) no Hoare annotation was computed. [2022-11-25 22:26:53,337 INFO L899 garLoopResultBuilder]: For program point L1556-1(lines 1556 1571) no Hoare annotation was computed. [2022-11-25 22:26:53,337 INFO L899 garLoopResultBuilder]: For program point L1614(lines 1614 1629) no Hoare annotation was computed. [2022-11-25 22:26:53,338 INFO L899 garLoopResultBuilder]: For program point L1581(line 1581) no Hoare annotation was computed. [2022-11-25 22:26:53,338 INFO L899 garLoopResultBuilder]: For program point L1581-1(lines 1581 1592) no Hoare annotation was computed. [2022-11-25 22:26:53,338 INFO L899 garLoopResultBuilder]: For program point L1606(line 1606) no Hoare annotation was computed. [2022-11-25 22:26:53,338 INFO L899 garLoopResultBuilder]: For program point L1573(lines 1573 1593) no Hoare annotation was computed. [2022-11-25 22:26:53,338 INFO L899 garLoopResultBuilder]: For program point L1606-1(lines 1606 1612) no Hoare annotation was computed. [2022-11-25 22:26:53,338 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1564) no Hoare annotation was computed. [2022-11-25 22:26:53,341 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: (let ((.cse43 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse20 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse58 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse79 (mod (let ((.cse81 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse83 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse80 (= .cse83 0)) (.cse82 (= .cse81 0)) (.cse84 (= .cse81 .cse83))) (ite (= (ite .cse80 .cse81 (ite .cse82 .cse83 (ite .cse84 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse80 .cse81 (ite .cse82 .cse83 (ite .cse84 0 v_~bitwiseXor_148))) (ite (= (ite .cse80 .cse81 (ite .cse82 .cse83 (ite .cse84 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse79 2147483647) .cse79 (+ .cse79 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647)))) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse10 (= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse11 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse12 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse13 (= (select |#length| 6) 18)) (.cse14 (= (select (select |#memory_int| 1) 0) 0)) (.cse15 (= ~globalArgv~0.offset 0)) (.cse16 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= (select |#valid| 7) 1)) (.cse19 (= 21 (select |#length| 5))) (.cse21 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse23 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse24 (= 48 (select |#length| 3))) (.cse25 (= 16 (select |#length| 7))) (.cse66 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse35 (= ~globalArgv~0.base 0)) (.cse36 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse37 (= (select |#valid| 0) 0)) (.cse38 (= (select |#length| 1) 1)) (.cse39 (= (select |#valid| 2) 1)) (.cse40 (= |#NULL.offset| 0)) (.cse55 (<= |ULTIMATE.start_goodG2B1_~data~2#1| 0)) (.cse41 (= ~globalFalse~0 0)) (.cse56 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (= ~globalArgc~0 0)) (.cse57 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse44 (= (select |#valid| 6) 1)) (.cse45 (= 5 ~globalFive~0)) (.cse59 (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (.cse46 (< 0 |#StackHeapBarrier|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse4 (mod (let ((.cse6 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse8 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse5 (= .cse8 0)) (.cse7 (= .cse6 0)) (.cse9 (= .cse8 .cse6))) (ite (= (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse5 .cse6 (ite .cse7 .cse8 (ite .cse9 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse4 2147483647) .cse4 (+ .cse4 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse29 (mod (let ((.cse31 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse33 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse30 (= .cse33 0)) (.cse32 (= .cse31 0)) (.cse34 (= .cse31 .cse33))) (ite (= (ite .cse30 .cse31 (ite .cse32 .cse33 (ite .cse34 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse30 .cse31 (ite .cse32 .cse33 (ite .cse34 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse30 .cse31 (ite .cse32 .cse33 (ite .cse34 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse29 2147483647) .cse29 (+ (- 4294967296) .cse29)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse49 (mod (let ((.cse51 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse53 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse50 (= .cse53 0)) (.cse52 (= .cse51 0)) (.cse54 (= .cse51 .cse53))) (ite (= (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse49 2147483647) .cse49 (+ .cse49 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse55 .cse41 .cse56 .cse42 .cse57 .cse43 .cse44 .cse45 .cse58 .cse59 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse60 (mod (let ((.cse62 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse64 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse61 (= .cse64 0)) (.cse63 (= .cse62 0)) (.cse65 (= .cse62 .cse64))) (ite (= (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse60 2147483647) .cse60 (+ .cse60 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse23 .cse24 .cse25 .cse66 .cse26 .cse27 .cse28 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse55 .cse41 .cse56 .cse42 .cse44 .cse45 .cse58 .cse59 .cse46 .cse47 .cse48) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 (exists ((v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse67 (mod (+ (* (let ((.cse69 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19|)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse69 .cse71))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_147))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19|) 0 v_~bitwiseXor_150))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ .cse67 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19| 2147483647))) .cse24 .cse25 .cse66 .cse26 .cse27 .cse28 .cse35 .cse36 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse73 (mod (let ((.cse75 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse77 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse74 (= .cse77 0)) (.cse76 (= .cse75 0)) (.cse78 (= .cse77 .cse75))) (ite (= (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse74 .cse75 (ite .cse76 .cse77 (ite .cse78 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse73 2147483647) .cse73 (+ .cse73 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse37 .cse38 .cse39 .cse40 .cse55 .cse41 .cse56 .cse42 .cse57 .cse44 .cse45 .cse59 .cse46 .cse47 .cse48))) [2022-11-25 22:26:53,342 INFO L895 garLoopResultBuilder]: At program point L1565(line 1565) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) (= (select |#length| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~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|) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) (= (select |#valid| 4) 1) (= (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) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_148))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 22:26:53,342 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-25 22:26:53,343 INFO L899 garLoopResultBuilder]: For program point L1598-2(lines 1598 1605) no Hoare annotation was computed. [2022-11-25 22:26:53,344 INFO L895 garLoopResultBuilder]: At program point L1598-3(lines 1598 1605) the Hoare annotation is: (let ((.cse38 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse46 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse67 (mod (let ((.cse69 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse69 .cse71))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ .cse67 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647)))) (.cse17 (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) (.cse47 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse36 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse42 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse61 (mod (let ((.cse63 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse63 .cse65))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_148))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647)))) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse48 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse13 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse16 (= 48 (select |#length| 3))) (.cse18 (= 16 (select |#length| 7))) (.cse19 (= (select |#valid| 4) 1)) (.cse20 (= (select |#valid| 1) 1)) (.cse21 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select |#valid| 0) 0)) (.cse31 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse32 (= (select |#length| 1) 1)) (.cse33 (= (select |#valid| 2) 1)) (.cse34 (= |#NULL.offset| 0)) (.cse35 (= ~globalFalse~0 0)) (.cse37 (= ~globalArgc~0 0)) (.cse39 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= 5 ~globalFive~0)) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse22 (mod (let ((.cse24 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse26 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse23 (= .cse26 0)) (.cse25 (= .cse24 0)) (.cse27 (= .cse24 .cse26))) (ite (= (ite .cse23 .cse24 (ite .cse25 .cse26 (ite .cse27 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse23 .cse24 (ite .cse25 .cse26 (ite .cse27 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse23 .cse24 (ite .cse25 .cse26 (ite .cse27 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse22 2147483647) .cse22 (+ .cse22 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 (+ 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse46 .cse15 .cse16 .cse17 .cse18 .cse47 .cse19 .cse20 .cse21 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse48 .cse13 .cse14 .cse46 .cse15 .cse16 .cse17 .cse18 .cse47 .cse19 .cse20 .cse21 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse49 (mod (let ((.cse51 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse53 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse50 (= .cse53 0)) (.cse52 (= .cse51 0)) (.cse54 (= .cse53 .cse51))) (ite (= (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse50 .cse51 (ite .cse52 .cse53 (ite .cse54 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse49 2147483647) .cse49 (+ .cse49 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse48 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse55 (mod (let ((.cse57 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse59 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse56 (= .cse59 0)) (.cse58 (= .cse57 0)) (.cse60 (= .cse57 .cse59))) (ite (= (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse55 2147483647) .cse55 (+ (- 4294967296) .cse55)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse39 .cse40 .cse41 .cse43 .cse44 .cse45))) [2022-11-25 22:26:53,346 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse13 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 48 (select |#length| 3))) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse32 (= (select |#valid| 2) 1)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~globalFalse~0 0)) (.cse35 (= ~globalArgc~0 0)) (.cse36 (= (select |#valid| 6) 1)) (.cse37 (= 5 ~globalFive~0)) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse16 (mod (let ((.cse18 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse20 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse17 (= .cse20 0)) (.cse19 (= .cse18 0)) (.cse21 (= .cse18 .cse20))) (ite (= (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse16 2147483647) .cse16 (+ .cse16 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse22 .cse23 .cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse38 (mod (let ((.cse40 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse42 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse39 (= .cse42 0)) (.cse41 (= .cse40 0)) (.cse43 (= .cse40 .cse42))) (ite (= (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_148))) (ite (= (ite .cse39 .cse40 (ite .cse41 .cse42 (ite .cse43 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse38 2147483647) .cse38 (+ .cse38 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse47 (mod (let ((.cse49 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse51 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse48 (= .cse51 0)) (.cse50 (= .cse49 0)) (.cse52 (= .cse51 .cse49))) (ite (= (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse47 2147483647) .cse47 (+ .cse47 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse53 (mod (let ((.cse55 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse57 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse54 (= .cse57 0)) (.cse56 (= .cse55 0)) (.cse58 (= .cse55 .cse57))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse53 2147483647) .cse53 (+ (- 4294967296) .cse53)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) .cse36 .cse37 .cse44 .cse45 .cse46))) [2022-11-25 22:26:53,347 INFO L895 garLoopResultBuilder]: At program point L1640(line 1640) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |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| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~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|) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (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) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 22:26:53,347 INFO L899 garLoopResultBuilder]: For program point L1640-1(line 1640) no Hoare annotation was computed. [2022-11-25 22:26:53,347 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-25 22:26:53,348 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 1591) no Hoare annotation was computed. [2022-11-25 22:26:53,348 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: false [2022-11-25 22:26:53,348 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-25 22:26:53,348 INFO L899 garLoopResultBuilder]: For program point L1625-1(line 1625) no Hoare annotation was computed. [2022-11-25 22:26:53,348 INFO L902 garLoopResultBuilder]: At program point L1642(line 1642) the Hoare annotation is: true [2022-11-25 22:26:53,348 INFO L899 garLoopResultBuilder]: For program point L1609(line 1609) no Hoare annotation was computed. [2022-11-25 22:26:53,349 INFO L902 garLoopResultBuilder]: At program point L1642-1(line 1642) the Hoare annotation is: true [2022-11-25 22:26:53,349 INFO L899 garLoopResultBuilder]: For program point L1609-1(line 1609) no Hoare annotation was computed. [2022-11-25 22:26:53,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1609) no Hoare annotation was computed. [2022-11-25 22:26:53,349 INFO L902 garLoopResultBuilder]: At program point L1626(line 1626) the Hoare annotation is: true [2022-11-25 22:26:53,351 INFO L895 garLoopResultBuilder]: At program point L1618(line 1618) the Hoare annotation is: (let ((.cse13 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse26 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 48 (select |#length| 3))) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= |ULTIMATE.start_goodG2B2_~data~3#1| 0)) (.cse27 (= (select |#valid| 4) 1)) (.cse28 (= (select |#valid| 1) 1)) (.cse29 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse30 (= ~globalArgv~0.base 0)) (.cse31 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse32 (= (select |#valid| 0) 0)) (.cse33 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse34 (= (select |#length| 1) 1)) (.cse35 (= (select |#valid| 2) 1)) (.cse36 (= |#NULL.offset| 0)) (.cse37 (= ~globalFalse~0 0)) (.cse38 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse39 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse40 (= ~globalArgc~0 0)) (.cse60 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse59 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse67 (mod (let ((.cse69 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse69 .cse71))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_148))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ .cse67 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647)))) (.cse44 (< 0 |#StackHeapBarrier|)) (.cse45 (= |#NULL.base| 0)) (.cse46 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse16 (mod (let ((.cse18 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse20 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse17 (= .cse20 0)) (.cse19 (= .cse18 0)) (.cse21 (= .cse18 .cse20))) (ite (= (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse16 2147483647) .cse16 (+ .cse16 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse47 (mod (let ((.cse49 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse51 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse48 (= .cse51 0)) (.cse50 (= .cse49 0)) (.cse52 (= .cse51 .cse49))) (ite (= (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse48 .cse49 (ite .cse50 .cse51 (ite .cse52 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse47 2147483647) .cse47 (+ .cse47 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse53 (mod (let ((.cse55 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse57 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse54 (= .cse57 0)) (.cse56 (= .cse55 0)) (.cse58 (= .cse55 .cse57))) (ite (= (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse54 .cse55 (ite .cse56 .cse57 (ite .cse58 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse53 2147483647) .cse53 (+ (- 4294967296) .cse53)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse59 .cse41 .cse42 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648)) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse60 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse61 (mod (let ((.cse63 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse63 .cse65))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse60 .cse59 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))) [2022-11-25 22:26:53,351 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2022-11-25 22:26:53,351 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-25 22:26:53,352 INFO L895 garLoopResultBuilder]: At program point L1552(line 1552) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |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| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~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_goodB2G1_~data~0#1| 0) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (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) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 22:26:53,352 INFO L899 garLoopResultBuilder]: For program point L1585-1(line 1585) no Hoare annotation was computed. [2022-11-25 22:26:53,352 INFO L899 garLoopResultBuilder]: For program point L1552-1(line 1552) no Hoare annotation was computed. [2022-11-25 22:26:53,354 INFO L895 garLoopResultBuilder]: At program point L1618-4(lines 1618 1621) the Hoare annotation is: (let ((.cse47 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse19 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse13 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse16 (= (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2) 0)) (.cse17 (= 48 (select |#length| 3))) (.cse18 (= 16 (select |#length| 7))) (.cse20 (= (select |#valid| 4) 1)) (.cse21 (= (select |#valid| 1) 1)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse23 (= ~globalArgv~0.base 0)) (.cse24 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse25 (= (select |#valid| 0) 0)) (.cse26 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse27 (= (select |#length| 1) 1)) (.cse28 (= (select |#valid| 2) 1)) (.cse29 (= |#NULL.offset| 0)) (.cse30 (= ~globalFalse~0 0)) (.cse31 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse32 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse33 (= ~globalArgc~0 0)) (.cse34 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse54 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse35 (= (select |#valid| 6) 1)) (.cse36 (= 5 ~globalFive~0)) (.cse37 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse67 (mod (let ((.cse69 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse71 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse68 (= .cse71 0)) (.cse70 (= .cse69 0)) (.cse72 (= .cse69 .cse71))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_148))) (ite (= (ite .cse68 .cse69 (ite .cse70 .cse71 (ite .cse72 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse67 2147483647) .cse67 (+ .cse67 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647)))) (.cse38 (< 0 |#StackHeapBarrier|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648)) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse41 (mod (let ((.cse43 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse45 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse42 (= .cse45 0)) (.cse44 (= .cse43 0)) (.cse46 (= .cse45 .cse43))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse41 2147483647) .cse41 (+ .cse41 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse47 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse48 (mod (let ((.cse50 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse52 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse49 (= .cse52 0)) (.cse51 (= .cse50 0)) (.cse53 (= .cse50 .cse52))) (ite (= (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse49 .cse50 (ite .cse51 .cse52 (ite .cse53 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse48 2147483647) .cse48 (+ (- 4294967296) .cse48)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse54 .cse35 .cse36 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse47 .cse13 .cse14 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse55 (mod (let ((.cse57 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse59 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse56 (= .cse59 0)) (.cse58 (= .cse57 0)) (.cse60 (= .cse57 .cse59))) (ite (= (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse56 .cse57 (ite .cse58 .cse59 (ite .cse60 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse55 2147483647) .cse55 (+ .cse55 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse61 (mod (let ((.cse63 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse65 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse62 (= .cse65 0)) (.cse64 (= .cse63 0)) (.cse66 (= .cse63 .cse65))) (ite (= (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse62 .cse63 (ite .cse64 .cse65 (ite .cse66 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse61 2147483647) .cse61 (+ .cse61 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse54 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40))) [2022-11-25 22:26:53,354 INFO L895 garLoopResultBuilder]: At program point L1552-4(lines 1552 1555) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |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| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~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|) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (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) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_148))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 22:26:53,356 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: (let ((.cse13 (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) (.cse53 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) (.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse22 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 48 (select |#length| 3))) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|)) (.cse26 (= (select |#valid| 4) 1)) (.cse27 (= (select |#valid| 1) 1)) (.cse28 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse29 (= ~globalArgv~0.base 0)) (.cse30 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse31 (= (select |#valid| 0) 0)) (.cse32 (= (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|) 0)) (.cse33 (= (select |#length| 1) 1)) (.cse34 (= (select |#valid| 2) 1)) (.cse35 (= |#NULL.offset| 0)) (.cse36 (= ~globalFalse~0 0)) (.cse37 (= |ULTIMATE.start_goodG2B1_~data~2#1| (+ |ULTIMATE.start_goodG2B1_~result~2#1| 1))) (.cse38 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse39 (= ~globalArgc~0 0)) (.cse52 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse40 (= (select |#valid| 6) 1)) (.cse41 (= 5 ~globalFive~0)) (.cse42 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse66 (mod (let ((.cse68 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse70 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse67 (= .cse70 0)) (.cse69 (= .cse68 0)) (.cse71 (= .cse68 .cse70))) (ite (= (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_148))) (ite (= (ite .cse67 .cse68 (ite .cse69 .cse70 (ite .cse71 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse66 2147483647) .cse66 (+ .cse66 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647)))) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse16 (mod (let ((.cse18 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_16| 32768)) (.cse20 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|))) (let ((.cse17 (= .cse20 0)) (.cse19 (= .cse18 0)) (.cse21 (= .cse18 .cse20))) (ite (= (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| 0) (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_16| (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse16 2147483647) .cse16 (+ .cse16 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_16| 2147483647))) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse22 .cse23 .cse24 .cse26 .cse27 .cse28 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse46 (mod (let ((.cse48 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse50 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse47 (= .cse50 0)) (.cse49 (= .cse48 0)) (.cse51 (= .cse48 .cse50))) (ite (= (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse46 2147483647) .cse46 (+ .cse46 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse52 .cse53 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| Int) (v_~bitwiseXor_179 Int)) (and (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 2147483647) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse54 (mod (let ((.cse56 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14| 32768)) (.cse58 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|))) (let ((.cse55 (= .cse58 0)) (.cse57 (= .cse56 0)) (.cse59 (= .cse58 .cse56))) (ite (= (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| 0) (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_14| (ite .cse55 .cse56 (ite .cse57 .cse58 (ite .cse59 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse54 2147483647) .cse54 (+ .cse54 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_14|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_14|))) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse26 .cse27 .cse28 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| Int)) (and (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse60 (mod (let ((.cse62 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_16|)) (.cse64 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_16|))) (let ((.cse61 (= .cse64 0)) (.cse63 (= .cse62 0)) (.cse65 (= .cse62 .cse64))) (ite (= (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 0) (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_148))) (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| (ite .cse61 .cse62 (ite .cse63 .cse64 (ite .cse65 0 v_~bitwiseXor_149)))) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse60 2147483647) .cse60 (+ (- 4294967296) .cse60)))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_16| 2147483647))) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse53 .cse40 .cse41 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= 0 (+ |ULTIMATE.start_goodB2G2_~result~1#1| 2147483648)) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse52 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45))) [2022-11-25 22:26:53,357 INFO L895 garLoopResultBuilder]: At program point L1577(line 1577) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_goodB2G2_~data~1#1| 0)) (.cse5 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse6 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse7 (= (select |#length| 6) 18)) (.cse8 (= (select (select |#memory_int| 1) 0) 0)) (.cse9 (= ~globalArgv~0.offset 0)) (.cse10 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse11 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 7) 1)) (.cse13 (= 21 (select |#length| 5))) (.cse14 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse16 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse23 (= 48 (select |#length| 3))) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse32 (= (select |#valid| 2) 1)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~globalFalse~0 0)) (.cse35 (= ~globalArgc~0 0)) (.cse36 (= (select |#valid| 6) 1)) (.cse37 (= 5 ~globalFive~0)) (.cse38 (< 0 |#StackHeapBarrier|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse17 (mod (+ (* (let ((.cse19 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19|)) (.cse21 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19|))) (let ((.cse18 (= .cse21 0)) (.cse20 (= .cse19 0)) (.cse22 (= .cse19 .cse21))) (ite (= (ite .cse18 .cse19 (ite .cse20 .cse21 (ite .cse22 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| 0) (ite .cse18 .cse19 (ite .cse20 .cse21 (ite .cse22 0 v_~bitwiseXor_147))) (ite (= (ite .cse18 .cse19 (ite .cse20 .cse21 (ite .cse22 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19|) 0 v_~bitwiseXor_150))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse17 2147483647) .cse17 (+ .cse17 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19| 2147483647))) .cse23 .cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) .cse36 .cse37 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse41 (mod (let ((.cse43 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse45 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse42 (= .cse45 0)) (.cse44 (= .cse43 0)) (.cse46 (= .cse43 .cse45))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_148))) (ite (= (ite .cse42 .cse43 (ite .cse44 .cse45 (ite .cse46 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse41 2147483647) .cse41 (+ .cse41 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse38 .cse39 .cse40))) [2022-11-25 22:26:53,357 INFO L899 garLoopResultBuilder]: For program point L1577-1(line 1577) no Hoare annotation was computed. [2022-11-25 22:26:53,358 INFO L895 garLoopResultBuilder]: At program point L1577-4(lines 1577 1580) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse13 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse22 (= 48 (select |#length| 3))) (.cse23 (= 16 (select |#length| 7))) (.cse24 (= (select |#valid| 4) 1)) (.cse25 (= (select |#valid| 1) 1)) (.cse26 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse27 (= ~globalArgv~0.base 0)) (.cse28 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse35 (= (select |#valid| 0) 0)) (.cse36 (= (select |#length| 1) 1)) (.cse37 (= (select |#valid| 2) 1)) (.cse38 (= |#NULL.offset| 0)) (.cse39 (= ~globalFalse~0 0)) (.cse40 (= ~globalArgc~0 0)) (.cse41 (= (select |#valid| 6) 1)) (.cse42 (= 5 ~globalFive~0)) (.cse43 (< 0 |#StackHeapBarrier|)) (.cse44 (= |#NULL.base| 0)) (.cse45 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse16 (mod (+ (* (let ((.cse18 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19|)) (.cse20 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19|))) (let ((.cse17 (= .cse20 0)) (.cse19 (= .cse18 0)) (.cse21 (= .cse18 .cse20))) (ite (= (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| 0) (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_147))) (ite (= (ite .cse17 .cse18 (ite .cse19 .cse20 (ite .cse21 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19|) 0 v_~bitwiseXor_150))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse16 2147483647) .cse16 (+ .cse16 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19| 2147483647))) .cse22 .cse23 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse24 .cse25 .cse26 .cse27 .cse28 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| Int) (v_~bitwiseXor_182 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse29 (mod (let ((.cse31 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 32768)) (.cse33 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17|))) (let ((.cse30 (= .cse33 0)) (.cse32 (= .cse31 0)) (.cse34 (= .cse33 .cse31))) (ite (= (ite .cse30 .cse31 (ite .cse32 .cse33 (ite .cse34 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 0) (ite .cse30 .cse31 (ite .cse32 .cse33 (ite .cse34 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| (ite .cse30 .cse31 (ite .cse32 .cse33 (ite .cse34 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse29 2147483647) .cse29 (+ .cse29 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17|) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_17|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_17| 2147483647))) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 (exists ((v_~bitwiseXor_184 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| Int) (v_~bitwiseXor_182 Int) (v_~bitwiseXor_181 Int) (|v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| Int) (v_~bitwiseXor_179 Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15|) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15| 2147483647) (<= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15|) (= |ULTIMATE.start_goodB2G2_~data~1#1| (let ((.cse46 (mod (let ((.cse48 (* |v_ULTIMATE.start_goodB2G2_#t~nondet105#1_15| 32768)) (.cse50 (* 1073741824 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) (let ((.cse47 (= .cse50 0)) (.cse49 (= .cse48 0)) (.cse51 (= .cse48 .cse50))) (ite (= (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_181))) 0) |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| 0) (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_182))) (ite (= |v_ULTIMATE.start_goodB2G2_#t~nondet106#1_15| (ite .cse47 .cse48 (ite .cse49 .cse50 (ite .cse51 0 v_~bitwiseXor_184)))) 0 v_~bitwiseXor_179))))) 4294967296))) (ite (<= .cse46 2147483647) .cse46 (+ .cse46 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G2_#t~nondet104#1_15|))) .cse27 .cse28 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) .cse41 .cse42 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse52 (mod (let ((.cse54 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse56 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse53 (= .cse56 0)) (.cse55 (= .cse54 0)) (.cse57 (= .cse54 .cse56))) (ite (= (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_148))) (ite (= (ite .cse53 .cse54 (ite .cse55 .cse56 (ite .cse57 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse52 2147483647) .cse52 (+ .cse52 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse43 .cse44 .cse45))) [2022-11-25 22:26:53,359 INFO L895 garLoopResultBuilder]: At program point L1569(line 1569) the Hoare annotation is: (and (= 21 (select |#length| 2)) (= ~GLOBAL_CONST_FALSE~0 0) (= 48 (select |#length| 4)) (= 1 (select |#valid| 5)) (= |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| 6) 18) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= (select |#valid| 7) 1) (= 21 (select |#length| 5)) (= ~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|) (= 48 (select |#length| 3)) (= 16 (select |#length| 7)) (= (select |#valid| 4) 1) (= (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) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) (= (select |#valid| 6) 1) (= 5 ~globalFive~0) (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse0 (mod (let ((.cse2 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse4 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse1 (= .cse4 0)) (.cse3 (= .cse2 0)) (.cse5 (= .cse2 .cse4))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_148))) (ite (= (ite .cse1 .cse2 (ite .cse3 .cse4 (ite .cse5 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-25 22:26:53,359 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 22:26:53,360 INFO L899 garLoopResultBuilder]: For program point L1569-1(lines 1556 1571) no Hoare annotation was computed. [2022-11-25 22:26:53,360 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1609) no Hoare annotation was computed. [2022-11-25 22:26:53,360 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 1613) no Hoare annotation was computed. [2022-11-25 22:26:53,361 INFO L895 garLoopResultBuilder]: At program point L1586(line 1586) the Hoare annotation is: (let ((.cse0 (= 21 (select |#length| 2))) (.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= 48 (select |#length| 4))) (.cse3 (= 1 (select |#valid| 5))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse6 (= (select |#length| 6) 18)) (.cse7 (= (select (select |#memory_int| 1) 0) 0)) (.cse8 (= ~globalArgv~0.offset 0)) (.cse9 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse10 (= (select |#valid| 3) 1)) (.cse11 (= (select |#valid| 7) 1)) (.cse12 (= 21 (select |#length| 5))) (.cse13 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse14 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse16 (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647))) (.cse23 (= 48 (select |#length| 3))) (.cse24 (= 16 (select |#length| 7))) (.cse25 (= (select |#valid| 4) 1)) (.cse26 (= (select |#valid| 1) 1)) (.cse27 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse28 (= ~globalArgv~0.base 0)) (.cse29 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse30 (= (select |#valid| 0) 0)) (.cse31 (= (select |#length| 1) 1)) (.cse32 (= (select |#valid| 2) 1)) (.cse33 (= |#NULL.offset| 0)) (.cse34 (= ~globalFalse~0 0)) (.cse35 (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) (.cse36 (= ~globalArgc~0 0)) (.cse37 (= |ULTIMATE.start_goodB2G2_~data~1#1| (+ |ULTIMATE.start_goodB2G2_~result~1#1| 1))) (.cse38 (= (select |#valid| 6) 1)) (.cse39 (= 5 ~globalFive~0)) (.cse40 (< 0 |#StackHeapBarrier|)) (.cse41 (= |#NULL.base| 0)) (.cse42 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (exists ((v_~bitwiseXor_150 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19| Int) (v_~bitwiseXor_147 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| Int) (v_~bitwiseXor_146 Int) (v_~bitwiseXor_145 Int)) (and (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse17 (mod (+ (* (let ((.cse19 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19|)) (.cse21 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19|))) (let ((.cse18 (= .cse21 0)) (.cse20 (= .cse19 0)) (.cse22 (= .cse19 .cse21))) (ite (= (ite .cse18 .cse19 (ite .cse20 .cse21 (ite .cse22 0 v_~bitwiseXor_146))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| 0) (ite .cse18 .cse19 (ite .cse20 .cse21 (ite .cse22 0 v_~bitwiseXor_147))) (ite (= (ite .cse18 .cse19 (ite .cse20 .cse21 (ite .cse22 0 v_~bitwiseXor_145))) |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19|) 0 v_~bitwiseXor_150))))) 4294967295) 4294967295) 4294967296))) (ite (<= .cse17 2147483647) .cse17 (+ .cse17 (- 4294967296))))) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet99#1_19|) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet97#1_19|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet98#1_19| 2147483647))) .cse23 .cse24 (= (+ |ULTIMATE.start_goodB2G1_~result~0#1| 1) |ULTIMATE.start_goodB2G1_~data~0#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0) .cse38 .cse39 (exists ((v_~bitwiseXor_151 Int) (v_~bitwiseXor_152 Int) (v_~bitwiseXor_148 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| Int) (v_~bitwiseXor_149 Int) (|v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| Int)) (and (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 2147483647) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17| 2147483647) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) (= |ULTIMATE.start_goodB2G1_~data~0#1| (let ((.cse43 (mod (let ((.cse45 (* 32768 |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17|)) (.cse47 (* 1073741824 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|))) (let ((.cse44 (= .cse47 0)) (.cse46 (= .cse45 0)) (.cse48 (= .cse45 .cse47))) (ite (= (ite .cse44 .cse45 (ite .cse46 .cse47 (ite .cse48 0 v_~bitwiseXor_152))) 0) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| (ite (= |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17| 0) (ite .cse44 .cse45 (ite .cse46 .cse47 (ite .cse48 0 v_~bitwiseXor_148))) (ite (= (ite .cse44 .cse45 (ite .cse46 .cse47 (ite .cse48 0 v_~bitwiseXor_149))) |v_ULTIMATE.start_goodB2G1_#t~nondet96#1_17|) 0 v_~bitwiseXor_151))))) 4294967296))) (ite (<= .cse43 2147483647) .cse43 (+ .cse43 (- 4294967296))))) (<= 0 |v_ULTIMATE.start_goodB2G1_#t~nondet94#1_17|) (<= |v_ULTIMATE.start_goodB2G1_#t~nondet95#1_17| 2147483647))) .cse40 .cse41 .cse42))) [2022-11-25 22:26:53,361 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1585) no Hoare annotation was computed. [2022-11-25 22:26:53,361 INFO L899 garLoopResultBuilder]: For program point L1562(lines 1562 1570) no Hoare annotation was computed. [2022-11-25 22:26:53,362 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1625) no Hoare annotation was computed. [2022-11-25 22:26:53,362 INFO L902 garLoopResultBuilder]: At program point globalReturnsTrueENTRY(lines 1510 1513) the Hoare annotation is: true [2022-11-25 22:26:53,362 INFO L899 garLoopResultBuilder]: For program point globalReturnsTrueEXIT(lines 1510 1513) no Hoare annotation was computed. [2022-11-25 22:26:53,365 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:26:53,368 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:26:53,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:26:53 BoogieIcfgContainer [2022-11-25 22:26:53,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:26:53,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:26:53,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:26:53,378 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:26:53,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:16:37" (3/4) ... [2022-11-25 22:26:53,382 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 22:26:53,388 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 22:26:53,388 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsFalse [2022-11-25 22:26:53,388 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 22:26:53,389 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure globalReturnsTrue [2022-11-25 22:26:53,394 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-25 22:26:53,395 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-25 22:26:53,395 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 22:26:53,396 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 22:26:53,443 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 22:26:53,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:26:53,444 INFO L158 Benchmark]: Toolchain (without parser) took 617938.83ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 120.5MB in the beginning and 179.6MB in the end (delta: -59.0MB). Peak memory consumption was 127.1MB. Max. memory is 16.1GB. [2022-11-25 22:26:53,444 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 130.0MB. Free memory was 93.6MB in the beginning and 93.5MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:26:53,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1390.16ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 96.4MB in the end (delta: 24.2MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-11-25 22:26:53,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.33ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 92.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 22:26:53,445 INFO L158 Benchmark]: Boogie Preprocessor took 35.75ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 90.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:26:53,445 INFO L158 Benchmark]: RCFGBuilder took 893.95ms. Allocated memory is still 167.8MB. Free memory was 90.1MB in the beginning and 123.2MB in the end (delta: -33.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2022-11-25 22:26:53,446 INFO L158 Benchmark]: TraceAbstraction took 615470.82ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 123.2MB in the beginning and 183.8MB in the end (delta: -60.6MB). Peak memory consumption was 209.0MB. Max. memory is 16.1GB. [2022-11-25 22:26:53,446 INFO L158 Benchmark]: Witness Printer took 65.52ms. Allocated memory is still 352.3MB. Free memory was 183.8MB in the beginning and 179.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 22:26:53,448 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.59ms. Allocated memory is still 130.0MB. Free memory was 93.6MB in the beginning and 93.5MB in the end (delta: 33.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1390.16ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 96.4MB in the end (delta: 24.2MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.33ms. Allocated memory is still 167.8MB. Free memory was 96.1MB in the beginning and 92.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.75ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 90.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 893.95ms. Allocated memory is still 167.8MB. Free memory was 90.1MB in the beginning and 123.2MB in the end (delta: -33.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 615470.82ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 123.2MB in the beginning and 183.8MB in the end (delta: -60.6MB). Peak memory consumption was 209.0MB. Max. memory is 16.1GB. * Witness Printer took 65.52ms. Allocated memory is still 352.3MB. Free memory was 183.8MB in the beginning and 179.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1564]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1609]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1625]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 65 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 615.4s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 53.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 65.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 2407 SdHoareTripleChecker+Invalid, 17.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1618 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4251 IncrementalHoareTripleChecker+Invalid, 4427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 789 mSDtfsCounter, 4251 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1048 GetRequests, 802 SyntacticMatches, 25 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2853 ImplicationChecksByTransitivity, 508.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 99 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 95 PreInvPairs, 126 NumberOfFragments, 21693 HoareAnnotationTreeSize, 95 FomulaSimplifications, 1173 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 23 FomulaSimplificationsInter, 39745 FormulaSimplificationTreeSizeReductionInter, 65.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1286 ConstructedInterpolants, 0 QuantifiedInterpolants, 1674 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1757 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 696/716 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: 16.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 212, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 132, TOOLS_POST_TIME: 4.1s, TOOLS_POST_CALL_APPLICATIONS: 144, TOOLS_POST_CALL_TIME: 6.3s, TOOLS_POST_RETURN_APPLICATIONS: 96, TOOLS_POST_RETURN_TIME: 3.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 372, TOOLS_QUANTIFIERELIM_TIME: 13.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 512, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 128, DOMAIN_JOIN_TIME: 1.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 212, DOMAIN_ISBOTTOM_TIME: 0.5s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 96, CALL_SUMMARIZER_CACHE_MISSES: 16, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 6394, DAG_COMPRESSION_RETAINED_NODES: 524, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1642]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 22:26:53,686 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-25 22:26:53,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a36f7bf3-59f0-4d15-b735-85ca5189a9b2/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE