./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan --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 32bit --witnessprinter.graph.data.programhash 6af52310ec13e6e7a94146d05f9e904086453aae ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:45:54,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:45:54,028 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:45:54,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:45:54,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:45:54,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:45:54,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:45:54,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:45:54,040 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:45:54,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:45:54,041 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:45:54,041 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:45:54,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:45:54,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:45:54,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:45:54,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:45:54,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:45:54,046 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:45:54,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:45:54,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:45:54,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:45:54,050 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:45:54,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:45:54,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:45:54,052 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:45:54,053 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:45:54,054 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:45:54,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:45:54,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:45:54,055 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:45:54,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:45:54,056 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:45:54,056 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:45:54,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:45:54,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:45:54,058 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:45:54,058 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-23 05:45:54,068 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:45:54,068 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:45:54,069 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:45:54,069 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:45:54,069 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:45:54,069 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:45:54,070 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:45:54,070 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:45:54,070 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:45:54,070 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:45:54,070 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:45:54,070 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:45:54,070 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:45:54,071 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:45:54,071 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:45:54,071 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:45:54,072 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:45:54,072 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:45:54,072 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:45:54,072 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:45:54,072 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:45:54,072 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:45:54,072 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 05:45:54,073 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:45:54,073 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:45:54,073 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:45:54,073 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:45:54,073 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:45:54,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:45:54,073 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:45:54,074 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:45:54,074 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:45:54,074 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:45:54,074 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:45:54,074 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:45:54,074 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:45:54,074 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:45:54,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:45:54,075 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:45:54,075 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6af52310ec13e6e7a94146d05f9e904086453aae [2018-11-23 05:45:54,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:45:54,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:45:54,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:45:54,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:45:54,112 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:45:54,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-11-23 05:45:54,153 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/data/247426ddb/9bf37ebce9f3457dba583cfe9c681be1/FLAGb3e343ee0 [2018-11-23 05:45:54,558 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:45:54,558 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/sv-benchmarks/c/bitvector/byte_add_false-no-overflow.i [2018-11-23 05:45:54,563 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/data/247426ddb/9bf37ebce9f3457dba583cfe9c681be1/FLAGb3e343ee0 [2018-11-23 05:45:54,572 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/data/247426ddb/9bf37ebce9f3457dba583cfe9c681be1 [2018-11-23 05:45:54,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:45:54,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:45:54,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:45:54,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:45:54,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:45:54,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3c8a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54, skipping insertion in model container [2018-11-23 05:45:54,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:45:54,606 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:45:54,729 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:45:54,732 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:45:54,752 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:45:54,760 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:45:54,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54 WrapperNode [2018-11-23 05:45:54,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:45:54,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:45:54,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:45:54,761 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:45:54,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:45:54,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:45:54,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:45:54,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:45:54,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... [2018-11-23 05:45:54,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:45:54,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:45:54,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:45:54,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:45:54,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:45:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2018-11-23 05:45:54,884 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2018-11-23 05:45:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:45:54,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:45:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:45:54,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:45:54,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:45:54,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:45:54,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 05:45:54,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 05:45:55,207 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:45:55,207 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 05:45:55,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:55 BoogieIcfgContainer [2018-11-23 05:45:55,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:45:55,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:45:55,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:45:55,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:45:55,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:45:54" (1/3) ... [2018-11-23 05:45:55,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58635184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:45:55, skipping insertion in model container [2018-11-23 05:45:55,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:54" (2/3) ... [2018-11-23 05:45:55,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58635184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:45:55, skipping insertion in model container [2018-11-23 05:45:55,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:55" (3/3) ... [2018-11-23 05:45:55,214 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_false-no-overflow.i [2018-11-23 05:45:55,223 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:45:55,230 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2018-11-23 05:45:55,245 INFO L257 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2018-11-23 05:45:55,273 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:45:55,273 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:45:55,273 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:45:55,273 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:45:55,274 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:45:55,274 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:45:55,274 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:45:55,274 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:45:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-11-23 05:45:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 05:45:55,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:55,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:45:55,300 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:55,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:55,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1025559455, now seen corresponding path program 1 times [2018-11-23 05:45:55,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:55,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:55,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:55,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:55,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 05:45:55,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:55,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 05:45:55,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 05:45:55,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:45:55,429 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-11-23 05:45:55,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:55,451 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2018-11-23 05:45:55,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 05:45:55,453 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-23 05:45:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:55,460 INFO L225 Difference]: With dead ends: 154 [2018-11-23 05:45:55,460 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 05:45:55,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 05:45:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 05:45:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-23 05:45:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 05:45:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2018-11-23 05:45:55,492 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 9 [2018-11-23 05:45:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:55,492 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2018-11-23 05:45:55,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 05:45:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2018-11-23 05:45:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 05:45:55,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:55,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:45:55,494 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:55,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash -133733111, now seen corresponding path program 1 times [2018-11-23 05:45:55,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:55,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:55,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:55,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:55,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:55,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:55,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:45:55,575 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:55,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:45:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:45:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:45:55,577 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand 3 states. [2018-11-23 05:45:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:55,708 INFO L93 Difference]: Finished difference Result 150 states and 217 transitions. [2018-11-23 05:45:55,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:45:55,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 05:45:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:55,710 INFO L225 Difference]: With dead ends: 150 [2018-11-23 05:45:55,710 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 05:45:55,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:45:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 05:45:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-23 05:45:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 05:45:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2018-11-23 05:45:55,717 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 18 [2018-11-23 05:45:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:55,718 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2018-11-23 05:45:55,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:45:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2018-11-23 05:45:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:45:55,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:55,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:45:55,719 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:55,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash -375227645, now seen corresponding path program 1 times [2018-11-23 05:45:55,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:55,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:55,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:55,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:45:55,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:55,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:45:55,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:55,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:45:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:45:55,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:45:55,790 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand 4 states. [2018-11-23 05:45:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:55,956 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2018-11-23 05:45:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:45:55,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 05:45:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:55,957 INFO L225 Difference]: With dead ends: 219 [2018-11-23 05:45:55,961 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 05:45:55,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:45:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 05:45:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 124. [2018-11-23 05:45:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 05:45:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 166 transitions. [2018-11-23 05:45:55,971 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 166 transitions. Word has length 25 [2018-11-23 05:45:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:55,971 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 166 transitions. [2018-11-23 05:45:55,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:45:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 166 transitions. [2018-11-23 05:45:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 05:45:55,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:55,972 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-23 05:45:55,973 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:55,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash -740983547, now seen corresponding path program 1 times [2018-11-23 05:45:55,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:55,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:55,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:45:56,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:56,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:45:56,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:56,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:45:56,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:45:56,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:45:56,058 INFO L87 Difference]: Start difference. First operand 124 states and 166 transitions. Second operand 4 states. [2018-11-23 05:45:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:56,242 INFO L93 Difference]: Finished difference Result 319 states and 452 transitions. [2018-11-23 05:45:56,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:45:56,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 05:45:56,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:56,244 INFO L225 Difference]: With dead ends: 319 [2018-11-23 05:45:56,244 INFO L226 Difference]: Without dead ends: 227 [2018-11-23 05:45:56,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:45:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-23 05:45:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 163. [2018-11-23 05:45:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 05:45:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 227 transitions. [2018-11-23 05:45:56,257 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 227 transitions. Word has length 32 [2018-11-23 05:45:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:56,257 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 227 transitions. [2018-11-23 05:45:56,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:45:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 227 transitions. [2018-11-23 05:45:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 05:45:56,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:56,259 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:45:56,259 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:56,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1838487559, now seen corresponding path program 1 times [2018-11-23 05:45:56,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:56,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:56,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 05:45:56,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:56,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:45:56,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:56,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:45:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:45:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:45:56,352 INFO L87 Difference]: Start difference. First operand 163 states and 227 transitions. Second operand 5 states. [2018-11-23 05:45:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:56,536 INFO L93 Difference]: Finished difference Result 460 states and 643 transitions. [2018-11-23 05:45:56,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:45:56,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-23 05:45:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:56,538 INFO L225 Difference]: With dead ends: 460 [2018-11-23 05:45:56,538 INFO L226 Difference]: Without dead ends: 327 [2018-11-23 05:45:56,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:45:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-23 05:45:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 176. [2018-11-23 05:45:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-23 05:45:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2018-11-23 05:45:56,551 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 39 [2018-11-23 05:45:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:56,551 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2018-11-23 05:45:56,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:45:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2018-11-23 05:45:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 05:45:56,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:56,553 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:45:56,554 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:56,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1692244499, now seen corresponding path program 1 times [2018-11-23 05:45:56,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:56,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:56,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:56,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:56,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:56,615 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 05:45:56,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:56,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:45:56,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:56,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:45:56,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:45:56,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:45:56,616 INFO L87 Difference]: Start difference. First operand 176 states and 243 transitions. Second operand 5 states. [2018-11-23 05:45:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:56,820 INFO L93 Difference]: Finished difference Result 466 states and 649 transitions. [2018-11-23 05:45:56,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:45:56,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 05:45:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:56,821 INFO L225 Difference]: With dead ends: 466 [2018-11-23 05:45:56,821 INFO L226 Difference]: Without dead ends: 333 [2018-11-23 05:45:56,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:45:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-23 05:45:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 189. [2018-11-23 05:45:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-23 05:45:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 257 transitions. [2018-11-23 05:45:56,830 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 257 transitions. Word has length 42 [2018-11-23 05:45:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:56,830 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 257 transitions. [2018-11-23 05:45:56,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:45:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 257 transitions. [2018-11-23 05:45:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 05:45:56,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:56,832 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:45:56,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:56,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash -756319486, now seen corresponding path program 1 times [2018-11-23 05:45:56,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:56,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:56,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:56,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:45:56,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:45:56,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:45:56,902 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-23 05:45:56,904 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:45:56,932 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:45:56,932 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:45:57,024 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:45:57,025 INFO L272 AbstractInterpreter]: Visited 18 different actions 18 times. Never merged. Never widened. Performed 59 root evaluator evaluations with a maximum evaluation depth of 3. Performed 59 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:45:57,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:57,030 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:45:57,082 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 56.33% of their original sizes. [2018-11-23 05:45:57,082 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:45:57,105 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-23 05:45:57,105 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:45:57,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:45:57,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-11-23 05:45:57,106 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:57,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:45:57,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:45:57,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:45:57,107 INFO L87 Difference]: Start difference. First operand 189 states and 257 transitions. Second operand 7 states. [2018-11-23 05:45:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:57,879 INFO L93 Difference]: Finished difference Result 903 states and 1261 transitions. [2018-11-23 05:45:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:45:57,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-23 05:45:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:57,881 INFO L225 Difference]: With dead ends: 903 [2018-11-23 05:45:57,881 INFO L226 Difference]: Without dead ends: 770 [2018-11-23 05:45:57,882 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:45:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-11-23 05:45:57,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 194. [2018-11-23 05:45:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-23 05:45:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2018-11-23 05:45:57,892 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 45 [2018-11-23 05:45:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:57,892 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2018-11-23 05:45:57,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:45:57,892 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2018-11-23 05:45:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 05:45:57,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:57,894 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:45:57,895 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:57,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash -384403935, now seen corresponding path program 1 times [2018-11-23 05:45:57,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:57,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:57,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:57,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:57,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:45:57,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:45:57,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:45:57,961 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-23 05:45:57,961 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:45:57,963 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:45:57,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:45:57,971 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:45:57,971 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 67 root evaluator evaluations with a maximum evaluation depth of 3. Performed 67 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:45:57,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:57,973 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:45:57,987 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 62.46% of their original sizes. [2018-11-23 05:45:57,987 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:45:58,007 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-23 05:45:58,007 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:45:58,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:45:58,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-23 05:45:58,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:58,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:45:58,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:45:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:45:58,008 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand 8 states. [2018-11-23 05:45:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:58,492 INFO L93 Difference]: Finished difference Result 1063 states and 1483 transitions. [2018-11-23 05:45:58,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:45:58,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-23 05:45:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:58,495 INFO L225 Difference]: With dead ends: 1063 [2018-11-23 05:45:58,495 INFO L226 Difference]: Without dead ends: 930 [2018-11-23 05:45:58,496 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:45:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-11-23 05:45:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 194. [2018-11-23 05:45:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-23 05:45:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2018-11-23 05:45:58,510 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 48 [2018-11-23 05:45:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:58,510 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2018-11-23 05:45:58,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:45:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2018-11-23 05:45:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 05:45:58,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:58,512 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:45:58,513 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:58,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash 672452032, now seen corresponding path program 1 times [2018-11-23 05:45:58,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:58,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:58,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:58,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:58,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:45:58,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:45:58,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:45:58,600 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-11-23 05:45:58,600 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:45:58,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:45:58,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:45:58,611 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:45:58,611 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 67 root evaluator evaluations with a maximum evaluation depth of 3. Performed 67 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:45:58,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:58,613 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:45:58,630 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 59.51% of their original sizes. [2018-11-23 05:45:58,631 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:45:58,664 INFO L415 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-11-23 05:45:58,664 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:45:58,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:45:58,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2018-11-23 05:45:58,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:58,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:45:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:45:58,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:45:58,665 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand 8 states. [2018-11-23 05:45:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:59,242 INFO L93 Difference]: Finished difference Result 1052 states and 1468 transitions. [2018-11-23 05:45:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:45:59,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-23 05:45:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:59,246 INFO L225 Difference]: With dead ends: 1052 [2018-11-23 05:45:59,246 INFO L226 Difference]: Without dead ends: 919 [2018-11-23 05:45:59,247 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:45:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-11-23 05:45:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 202. [2018-11-23 05:45:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-23 05:45:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 275 transitions. [2018-11-23 05:45:59,259 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 275 transitions. Word has length 48 [2018-11-23 05:45:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:59,259 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 275 transitions. [2018-11-23 05:45:59,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:45:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 275 transitions. [2018-11-23 05:45:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 05:45:59,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:59,260 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:45:59,261 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:45:59,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash -328370563, now seen corresponding path program 1 times [2018-11-23 05:45:59,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:59,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:59,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:45:59,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:45:59,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:45:59,345 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-23 05:45:59,345 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [57], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:45:59,347 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:45:59,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:45:59,356 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:45:59,356 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Performed 73 root evaluator evaluations with a maximum evaluation depth of 3. Performed 73 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:45:59,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:59,357 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:45:59,370 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 64.13% of their original sizes. [2018-11-23 05:45:59,371 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:45:59,414 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-23 05:45:59,414 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:45:59,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:45:59,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-23 05:45:59,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:59,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:45:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:45:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:45:59,415 INFO L87 Difference]: Start difference. First operand 202 states and 275 transitions. Second operand 9 states. [2018-11-23 05:46:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:00,041 INFO L93 Difference]: Finished difference Result 1066 states and 1486 transitions. [2018-11-23 05:46:00,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:46:00,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-23 05:46:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:00,044 INFO L225 Difference]: With dead ends: 1066 [2018-11-23 05:46:00,044 INFO L226 Difference]: Without dead ends: 933 [2018-11-23 05:46:00,045 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:46:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2018-11-23 05:46:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 197. [2018-11-23 05:46:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-23 05:46:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2018-11-23 05:46:00,058 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 50 [2018-11-23 05:46:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:00,058 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2018-11-23 05:46:00,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:46:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2018-11-23 05:46:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 05:46:00,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:00,059 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:46:00,059 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:00,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1569242044, now seen corresponding path program 1 times [2018-11-23 05:46:00,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:00,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:00,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:00,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:00,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:46:00,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:00,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:00,112 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-23 05:46:00,112 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:00,113 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:00,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:00,122 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:00,122 INFO L272 AbstractInterpreter]: Visited 23 different actions 23 times. Never merged. Never widened. Performed 73 root evaluator evaluations with a maximum evaluation depth of 3. Performed 73 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:46:00,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:00,125 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:00,140 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 61.1% of their original sizes. [2018-11-23 05:46:00,140 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:00,186 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-23 05:46:00,186 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:00,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:00,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-23 05:46:00,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:00,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:46:00,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:46:00,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:46:00,187 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand 9 states. [2018-11-23 05:46:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:00,584 INFO L93 Difference]: Finished difference Result 1051 states and 1463 transitions. [2018-11-23 05:46:00,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:46:00,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-11-23 05:46:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:00,587 INFO L225 Difference]: With dead ends: 1051 [2018-11-23 05:46:00,587 INFO L226 Difference]: Without dead ends: 918 [2018-11-23 05:46:00,587 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:46:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-11-23 05:46:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 199. [2018-11-23 05:46:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-23 05:46:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 270 transitions. [2018-11-23 05:46:00,596 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 270 transitions. Word has length 50 [2018-11-23 05:46:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:00,597 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 270 transitions. [2018-11-23 05:46:00,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:46:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 270 transitions. [2018-11-23 05:46:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 05:46:00,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:00,597 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:46:00,598 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:00,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:00,598 INFO L82 PathProgramCache]: Analyzing trace with hash -606991807, now seen corresponding path program 1 times [2018-11-23 05:46:00,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:00,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:00,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:00,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:00,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:46:00,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:00,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:00,650 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-23 05:46:00,650 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:00,651 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:00,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:00,659 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:00,659 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 times. Never merged. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 3. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:46:00,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:00,660 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:00,670 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 64.64% of their original sizes. [2018-11-23 05:46:00,670 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:00,689 INFO L415 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-11-23 05:46:00,689 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:00,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:00,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-11-23 05:46:00,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:00,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:46:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:46:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:46:00,690 INFO L87 Difference]: Start difference. First operand 199 states and 270 transitions. Second operand 9 states. [2018-11-23 05:46:01,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:01,081 INFO L93 Difference]: Finished difference Result 1201 states and 1675 transitions. [2018-11-23 05:46:01,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:46:01,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-23 05:46:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:01,083 INFO L225 Difference]: With dead ends: 1201 [2018-11-23 05:46:01,083 INFO L226 Difference]: Without dead ends: 1068 [2018-11-23 05:46:01,084 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:46:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-11-23 05:46:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 207. [2018-11-23 05:46:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 05:46:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 281 transitions. [2018-11-23 05:46:01,093 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 281 transitions. Word has length 51 [2018-11-23 05:46:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:01,093 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 281 transitions. [2018-11-23 05:46:01,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:46:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 281 transitions. [2018-11-23 05:46:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 05:46:01,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:01,094 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-23 05:46:01,094 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:01,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1331615022, now seen corresponding path program 1 times [2018-11-23 05:46:01,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:01,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:01,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:01,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:01,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 05:46:01,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:01,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:46:01,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:01,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:46:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:46:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:46:01,136 INFO L87 Difference]: Start difference. First operand 207 states and 281 transitions. Second operand 3 states. [2018-11-23 05:46:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:01,146 INFO L93 Difference]: Finished difference Result 264 states and 361 transitions. [2018-11-23 05:46:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:46:01,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 05:46:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:01,147 INFO L225 Difference]: With dead ends: 264 [2018-11-23 05:46:01,147 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 05:46:01,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:46:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 05:46:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-11-23 05:46:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-23 05:46:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 319 transitions. [2018-11-23 05:46:01,155 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 319 transitions. Word has length 51 [2018-11-23 05:46:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:01,155 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 319 transitions. [2018-11-23 05:46:01,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:46:01,155 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2018-11-23 05:46:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 05:46:01,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:01,156 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-23 05:46:01,156 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:01,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:01,156 INFO L82 PathProgramCache]: Analyzing trace with hash 822141932, now seen corresponding path program 1 times [2018-11-23 05:46:01,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:01,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:01,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:01,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:01,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:46:01,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:01,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:46:01,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:01,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:46:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:46:01,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:46:01,198 INFO L87 Difference]: Start difference. First operand 234 states and 319 transitions. Second operand 4 states. [2018-11-23 05:46:01,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:01,297 INFO L93 Difference]: Finished difference Result 588 states and 825 transitions. [2018-11-23 05:46:01,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:46:01,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-23 05:46:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:01,300 INFO L225 Difference]: With dead ends: 588 [2018-11-23 05:46:01,300 INFO L226 Difference]: Without dead ends: 425 [2018-11-23 05:46:01,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:46:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-11-23 05:46:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 363. [2018-11-23 05:46:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-23 05:46:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 502 transitions. [2018-11-23 05:46:01,319 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 502 transitions. Word has length 51 [2018-11-23 05:46:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:01,319 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 502 transitions. [2018-11-23 05:46:01,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:46:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 502 transitions. [2018-11-23 05:46:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 05:46:01,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:01,320 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-23 05:46:01,320 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:01,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:01,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1939291061, now seen corresponding path program 1 times [2018-11-23 05:46:01,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:01,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:01,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:01,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 05:46:01,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:01,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:01,423 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-23 05:46:01,423 INFO L202 CegarAbsIntRunner]: [0], [29], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [162], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:01,424 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:01,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:01,434 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:01,434 INFO L272 AbstractInterpreter]: Visited 24 different actions 24 times. Never merged. Never widened. Performed 77 root evaluator evaluations with a maximum evaluation depth of 4. Performed 77 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:46:01,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:01,436 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:01,450 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 43.78% of their original sizes. [2018-11-23 05:46:01,450 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:01,488 INFO L415 sIntCurrentIteration]: We unified 50 AI predicates to 50 [2018-11-23 05:46:01,488 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:01,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:01,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-23 05:46:01,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:01,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:46:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:46:01,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:46:01,489 INFO L87 Difference]: Start difference. First operand 363 states and 502 transitions. Second operand 7 states. [2018-11-23 05:46:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:02,020 INFO L93 Difference]: Finished difference Result 993 states and 1388 transitions. [2018-11-23 05:46:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:46:02,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-11-23 05:46:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:02,022 INFO L225 Difference]: With dead ends: 993 [2018-11-23 05:46:02,022 INFO L226 Difference]: Without dead ends: 835 [2018-11-23 05:46:02,023 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:46:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2018-11-23 05:46:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 363. [2018-11-23 05:46:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-23 05:46:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 502 transitions. [2018-11-23 05:46:02,035 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 502 transitions. Word has length 51 [2018-11-23 05:46:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:02,036 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 502 transitions. [2018-11-23 05:46:02,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:46:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 502 transitions. [2018-11-23 05:46:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 05:46:02,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:02,037 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:46:02,037 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:02,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2059084699, now seen corresponding path program 1 times [2018-11-23 05:46:02,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:02,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:02,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:46:02,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:02,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:02,082 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-23 05:46:02,082 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:02,083 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:02,083 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:02,090 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:02,090 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 81 root evaluator evaluations with a maximum evaluation depth of 3. Performed 81 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:46:02,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:02,091 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:02,103 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 65.79% of their original sizes. [2018-11-23 05:46:02,104 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:02,138 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-23 05:46:02,139 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:02,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:02,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-23 05:46:02,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:02,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:46:02,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:46:02,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:46:02,140 INFO L87 Difference]: Start difference. First operand 363 states and 502 transitions. Second operand 10 states. [2018-11-23 05:46:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:02,754 INFO L93 Difference]: Finished difference Result 1765 states and 2475 transitions. [2018-11-23 05:46:02,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:46:02,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-11-23 05:46:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:02,757 INFO L225 Difference]: With dead ends: 1765 [2018-11-23 05:46:02,758 INFO L226 Difference]: Without dead ends: 1605 [2018-11-23 05:46:02,759 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:46:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2018-11-23 05:46:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 355. [2018-11-23 05:46:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-11-23 05:46:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 491 transitions. [2018-11-23 05:46:02,776 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 491 transitions. Word has length 53 [2018-11-23 05:46:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:02,776 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 491 transitions. [2018-11-23 05:46:02,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:46:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 491 transitions. [2018-11-23 05:46:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 05:46:02,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:02,778 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:46:02,778 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:02,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1540842629, now seen corresponding path program 1 times [2018-11-23 05:46:02,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:02,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:02,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:02,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:46:02,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:02,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:02,829 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-11-23 05:46:02,829 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:02,830 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:02,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:02,836 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:02,837 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 81 root evaluator evaluations with a maximum evaluation depth of 3. Performed 81 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:46:02,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:02,838 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:02,851 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 65.79% of their original sizes. [2018-11-23 05:46:02,851 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:02,901 INFO L415 sIntCurrentIteration]: We unified 52 AI predicates to 52 [2018-11-23 05:46:02,901 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:02,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:02,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-23 05:46:02,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:02,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:46:02,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:46:02,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:46:02,902 INFO L87 Difference]: Start difference. First operand 355 states and 491 transitions. Second operand 10 states. [2018-11-23 05:46:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:03,382 INFO L93 Difference]: Finished difference Result 1769 states and 2477 transitions. [2018-11-23 05:46:03,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:46:03,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-11-23 05:46:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:03,385 INFO L225 Difference]: With dead ends: 1769 [2018-11-23 05:46:03,385 INFO L226 Difference]: Without dead ends: 1609 [2018-11-23 05:46:03,386 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:46:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2018-11-23 05:46:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 355. [2018-11-23 05:46:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-11-23 05:46:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 491 transitions. [2018-11-23 05:46:03,400 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 491 transitions. Word has length 53 [2018-11-23 05:46:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:03,400 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 491 transitions. [2018-11-23 05:46:03,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:46:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 491 transitions. [2018-11-23 05:46:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 05:46:03,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:03,401 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-11-23 05:46:03,402 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:03,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2127317583, now seen corresponding path program 1 times [2018-11-23 05:46:03,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:03,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:03,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:46:03,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:03,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:46:03,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:03,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:46:03,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:46:03,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:46:03,453 INFO L87 Difference]: Start difference. First operand 355 states and 491 transitions. Second operand 4 states. [2018-11-23 05:46:03,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:03,546 INFO L93 Difference]: Finished difference Result 1032 states and 1468 transitions. [2018-11-23 05:46:03,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:46:03,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-23 05:46:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:03,548 INFO L225 Difference]: With dead ends: 1032 [2018-11-23 05:46:03,548 INFO L226 Difference]: Without dead ends: 734 [2018-11-23 05:46:03,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:46:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-23 05:46:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 637. [2018-11-23 05:46:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2018-11-23 05:46:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 886 transitions. [2018-11-23 05:46:03,576 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 886 transitions. Word has length 54 [2018-11-23 05:46:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:03,576 INFO L480 AbstractCegarLoop]: Abstraction has 637 states and 886 transitions. [2018-11-23 05:46:03,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:46:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 886 transitions. [2018-11-23 05:46:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 05:46:03,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:03,577 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-23 05:46:03,577 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:03,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:03,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1943944617, now seen corresponding path program 1 times [2018-11-23 05:46:03,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:03,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:03,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:46:03,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:03,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:03,637 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-23 05:46:03,637 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [69], [206], [208], [211], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:03,638 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:03,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:03,645 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:03,645 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Performed 87 root evaluator evaluations with a maximum evaluation depth of 3. Performed 87 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-23 05:46:03,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:03,658 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:03,670 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 66.71% of their original sizes. [2018-11-23 05:46:03,671 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:03,732 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-23 05:46:03,733 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:03,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:03,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-23 05:46:03,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:03,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 05:46:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:46:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:46:03,734 INFO L87 Difference]: Start difference. First operand 637 states and 886 transitions. Second operand 11 states. [2018-11-23 05:46:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:04,275 INFO L93 Difference]: Finished difference Result 1757 states and 2454 transitions. [2018-11-23 05:46:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:46:04,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-11-23 05:46:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:04,277 INFO L225 Difference]: With dead ends: 1757 [2018-11-23 05:46:04,278 INFO L226 Difference]: Without dead ends: 1597 [2018-11-23 05:46:04,278 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:46:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2018-11-23 05:46:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 621. [2018-11-23 05:46:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-23 05:46:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 865 transitions. [2018-11-23 05:46:04,296 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 865 transitions. Word has length 55 [2018-11-23 05:46:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:04,296 INFO L480 AbstractCegarLoop]: Abstraction has 621 states and 865 transitions. [2018-11-23 05:46:04,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 05:46:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 865 transitions. [2018-11-23 05:46:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 05:46:04,297 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:04,297 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:04,298 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:04,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2011291791, now seen corresponding path program 1 times [2018-11-23 05:46:04,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:04,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:04,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:46:04,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:04,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:04,331 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-23 05:46:04,331 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:04,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:04,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:04,347 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:04,347 INFO L272 AbstractInterpreter]: Visited 40 different actions 44 times. Merged at 3 different actions 3 times. Never widened. Performed 149 root evaluator evaluations with a maximum evaluation depth of 4. Performed 149 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-23 05:46:04,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:04,357 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:04,383 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 51.28% of their original sizes. [2018-11-23 05:46:04,383 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:04,419 INFO L415 sIntCurrentIteration]: We unified 59 AI predicates to 59 [2018-11-23 05:46:04,419 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:04,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:04,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-23 05:46:04,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:04,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:46:04,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:46:04,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:46:04,421 INFO L87 Difference]: Start difference. First operand 621 states and 865 transitions. Second operand 10 states. [2018-11-23 05:46:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:04,955 INFO L93 Difference]: Finished difference Result 1314 states and 1828 transitions. [2018-11-23 05:46:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:46:04,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-11-23 05:46:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:04,957 INFO L225 Difference]: With dead ends: 1314 [2018-11-23 05:46:04,958 INFO L226 Difference]: Without dead ends: 1156 [2018-11-23 05:46:04,958 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:46:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-11-23 05:46:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 667. [2018-11-23 05:46:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-11-23 05:46:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 921 transitions. [2018-11-23 05:46:04,986 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 921 transitions. Word has length 60 [2018-11-23 05:46:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:04,986 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 921 transitions. [2018-11-23 05:46:04,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:46:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 921 transitions. [2018-11-23 05:46:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 05:46:04,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:04,987 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:04,987 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:04,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1571513232, now seen corresponding path program 1 times [2018-11-23 05:46:04,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:04,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:04,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:46:05,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:05,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:05,035 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-23 05:46:05,035 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:05,036 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:05,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:05,045 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:05,045 INFO L272 AbstractInterpreter]: Visited 43 different actions 47 times. Merged at 3 different actions 3 times. Never widened. Performed 157 root evaluator evaluations with a maximum evaluation depth of 4. Performed 157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-23 05:46:05,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:05,047 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:05,059 INFO L227 lantSequenceWeakener]: Weakened 35 states. On average, predicates are now at 57.49% of their original sizes. [2018-11-23 05:46:05,060 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:05,101 INFO L415 sIntCurrentIteration]: We unified 62 AI predicates to 62 [2018-11-23 05:46:05,101 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:05,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:05,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-23 05:46:05,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:05,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 05:46:05,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:46:05,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:46:05,102 INFO L87 Difference]: Start difference. First operand 667 states and 921 transitions. Second operand 11 states. [2018-11-23 05:46:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:05,856 INFO L93 Difference]: Finished difference Result 1662 states and 2309 transitions. [2018-11-23 05:46:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:46:05,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-23 05:46:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:05,859 INFO L225 Difference]: With dead ends: 1662 [2018-11-23 05:46:05,859 INFO L226 Difference]: Without dead ends: 1504 [2018-11-23 05:46:05,860 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:46:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2018-11-23 05:46:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 667. [2018-11-23 05:46:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-11-23 05:46:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 921 transitions. [2018-11-23 05:46:05,882 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 921 transitions. Word has length 63 [2018-11-23 05:46:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:05,882 INFO L480 AbstractCegarLoop]: Abstraction has 667 states and 921 transitions. [2018-11-23 05:46:05,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 05:46:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 921 transitions. [2018-11-23 05:46:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 05:46:05,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:05,883 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:05,884 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:05,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:05,884 INFO L82 PathProgramCache]: Analyzing trace with hash 787282449, now seen corresponding path program 1 times [2018-11-23 05:46:05,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:05,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:05,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:05,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:05,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:46:05,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:05,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:05,934 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-23 05:46:05,934 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:05,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:05,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:05,944 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:05,944 INFO L272 AbstractInterpreter]: Visited 43 different actions 47 times. Merged at 3 different actions 3 times. Never widened. Performed 157 root evaluator evaluations with a maximum evaluation depth of 4. Performed 157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-23 05:46:05,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:05,946 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:05,960 INFO L227 lantSequenceWeakener]: Weakened 35 states. On average, predicates are now at 56.39% of their original sizes. [2018-11-23 05:46:05,960 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:05,995 INFO L415 sIntCurrentIteration]: We unified 62 AI predicates to 62 [2018-11-23 05:46:05,995 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:05,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:05,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2018-11-23 05:46:05,996 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:05,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 05:46:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 05:46:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:46:05,997 INFO L87 Difference]: Start difference. First operand 667 states and 921 transitions. Second operand 11 states. [2018-11-23 05:46:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:06,601 INFO L93 Difference]: Finished difference Result 1559 states and 2158 transitions. [2018-11-23 05:46:06,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:46:06,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-11-23 05:46:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:06,607 INFO L225 Difference]: With dead ends: 1559 [2018-11-23 05:46:06,607 INFO L226 Difference]: Without dead ends: 1401 [2018-11-23 05:46:06,608 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:46:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-11-23 05:46:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 675. [2018-11-23 05:46:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-11-23 05:46:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 932 transitions. [2018-11-23 05:46:06,643 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 932 transitions. Word has length 63 [2018-11-23 05:46:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:06,643 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 932 transitions. [2018-11-23 05:46:06,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 05:46:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 932 transitions. [2018-11-23 05:46:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 05:46:06,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:06,645 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:06,645 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:06,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash 837913534, now seen corresponding path program 1 times [2018-11-23 05:46:06,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:06,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:06,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:06,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:06,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:46:06,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:06,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:06,709 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-23 05:46:06,709 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [116], [120], [123], [125], [127], [139], [149], [159], [162], [166], [168], [172], [174], [178], [180], [186], [192], [195], [197], [206], [208], [213], [219], [223], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:06,710 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:06,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:06,729 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:06,729 INFO L272 AbstractInterpreter]: Visited 45 different actions 63 times. Merged at 9 different actions 12 times. Never widened. Performed 228 root evaluator evaluations with a maximum evaluation depth of 4. Performed 228 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-23 05:46:06,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:06,732 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:06,757 INFO L227 lantSequenceWeakener]: Weakened 42 states. On average, predicates are now at 55.18% of their original sizes. [2018-11-23 05:46:06,757 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:06,808 INFO L415 sIntCurrentIteration]: We unified 62 AI predicates to 62 [2018-11-23 05:46:06,808 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:06,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:06,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-11-23 05:46:06,809 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:06,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 05:46:06,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 05:46:06,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:46:06,809 INFO L87 Difference]: Start difference. First operand 675 states and 932 transitions. Second operand 13 states. [2018-11-23 05:46:08,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:08,160 INFO L93 Difference]: Finished difference Result 1463 states and 2005 transitions. [2018-11-23 05:46:08,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:46:08,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 63 [2018-11-23 05:46:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:08,163 INFO L225 Difference]: With dead ends: 1463 [2018-11-23 05:46:08,163 INFO L226 Difference]: Without dead ends: 1305 [2018-11-23 05:46:08,164 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:46:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2018-11-23 05:46:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 719. [2018-11-23 05:46:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-11-23 05:46:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 984 transitions. [2018-11-23 05:46:08,200 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 984 transitions. Word has length 63 [2018-11-23 05:46:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:08,200 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 984 transitions. [2018-11-23 05:46:08,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 05:46:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 984 transitions. [2018-11-23 05:46:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 05:46:08,201 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:08,201 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:08,202 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:08,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:08,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1910513588, now seen corresponding path program 1 times [2018-11-23 05:46:08,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:08,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:08,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:08,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:46:08,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:08,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:08,257 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-23 05:46:08,257 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [17], [19], [21], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:08,258 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:08,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:08,272 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:08,272 INFO L272 AbstractInterpreter]: Visited 45 different actions 48 times. Merged at 2 different actions 2 times. Never widened. Performed 158 root evaluator evaluations with a maximum evaluation depth of 4. Performed 158 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-23 05:46:08,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:08,274 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:08,292 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 58.43% of their original sizes. [2018-11-23 05:46:08,292 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:08,378 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-23 05:46:08,379 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:08,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:08,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-23 05:46:08,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:08,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:46:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:46:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:46:08,380 INFO L87 Difference]: Start difference. First operand 719 states and 984 transitions. Second operand 12 states. [2018-11-23 05:46:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:09,166 INFO L93 Difference]: Finished difference Result 1748 states and 2411 transitions. [2018-11-23 05:46:09,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:46:09,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-23 05:46:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:09,169 INFO L225 Difference]: With dead ends: 1748 [2018-11-23 05:46:09,169 INFO L226 Difference]: Without dead ends: 1590 [2018-11-23 05:46:09,169 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:46:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-11-23 05:46:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 757. [2018-11-23 05:46:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-11-23 05:46:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1029 transitions. [2018-11-23 05:46:09,192 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1029 transitions. Word has length 65 [2018-11-23 05:46:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:09,192 INFO L480 AbstractCegarLoop]: Abstraction has 757 states and 1029 transitions. [2018-11-23 05:46:09,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:46:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1029 transitions. [2018-11-23 05:46:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 05:46:09,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:09,194 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:09,194 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:09,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash -272225523, now seen corresponding path program 1 times [2018-11-23 05:46:09,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:09,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:09,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:09,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:09,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:46:09,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:09,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:09,238 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-23 05:46:09,238 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [26], [31], [34], [36], [38], [41], [43], [45], [48], [50], [52], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:09,239 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:09,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:09,247 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:09,247 INFO L272 AbstractInterpreter]: Visited 45 different actions 49 times. Merged at 3 different actions 3 times. Never widened. Performed 164 root evaluator evaluations with a maximum evaluation depth of 4. Performed 164 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-23 05:46:09,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:09,249 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:09,261 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 57.2% of their original sizes. [2018-11-23 05:46:09,261 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:09,299 INFO L415 sIntCurrentIteration]: We unified 64 AI predicates to 64 [2018-11-23 05:46:09,299 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:09,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:09,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-23 05:46:09,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:09,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:46:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:46:09,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:46:09,300 INFO L87 Difference]: Start difference. First operand 757 states and 1029 transitions. Second operand 12 states. [2018-11-23 05:46:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:10,264 INFO L93 Difference]: Finished difference Result 1626 states and 2239 transitions. [2018-11-23 05:46:10,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:46:10,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-11-23 05:46:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:10,266 INFO L225 Difference]: With dead ends: 1626 [2018-11-23 05:46:10,266 INFO L226 Difference]: Without dead ends: 1468 [2018-11-23 05:46:10,267 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:46:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-11-23 05:46:10,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 794. [2018-11-23 05:46:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-11-23 05:46:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1073 transitions. [2018-11-23 05:46:10,307 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1073 transitions. Word has length 65 [2018-11-23 05:46:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:10,307 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 1073 transitions. [2018-11-23 05:46:10,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:46:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1073 transitions. [2018-11-23 05:46:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 05:46:10,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:10,309 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:10,309 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:10,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:10,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1005515920, now seen corresponding path program 1 times [2018-11-23 05:46:10,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:10,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:10,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:10,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:10,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:46:10,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:10,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:10,373 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-23 05:46:10,373 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [41], [43], [45], [54], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [120], [123], [125], [127], [139], [149], [159], [168], [172], [180], [186], [192], [195], [197], [206], [208], [213], [217], [219], [223], [225], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:10,374 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:10,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:10,384 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:46:10,384 INFO L272 AbstractInterpreter]: Visited 46 different actions 50 times. Merged at 3 different actions 3 times. Never widened. Performed 165 root evaluator evaluations with a maximum evaluation depth of 4. Performed 165 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-11-23 05:46:10,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:10,389 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:46:10,405 INFO L227 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 61.38% of their original sizes. [2018-11-23 05:46:10,406 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:46:10,463 INFO L415 sIntCurrentIteration]: We unified 65 AI predicates to 65 [2018-11-23 05:46:10,464 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:46:10,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:10,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-11-23 05:46:10,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:10,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:46:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:46:10,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:46:10,465 INFO L87 Difference]: Start difference. First operand 794 states and 1073 transitions. Second operand 12 states. [2018-11-23 05:46:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:10,900 INFO L93 Difference]: Finished difference Result 1968 states and 2712 transitions. [2018-11-23 05:46:10,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:46:10,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-23 05:46:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:10,905 INFO L225 Difference]: With dead ends: 1968 [2018-11-23 05:46:10,905 INFO L226 Difference]: Without dead ends: 1810 [2018-11-23 05:46:10,906 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:46:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2018-11-23 05:46:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 797. [2018-11-23 05:46:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-23 05:46:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1077 transitions. [2018-11-23 05:46:10,948 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1077 transitions. Word has length 66 [2018-11-23 05:46:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:10,948 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1077 transitions. [2018-11-23 05:46:10,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:46:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1077 transitions. [2018-11-23 05:46:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 05:46:10,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:10,950 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:10,950 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:10,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:10,950 INFO L82 PathProgramCache]: Analyzing trace with hash -954884835, now seen corresponding path program 1 times [2018-11-23 05:46:10,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:10,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:10,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:10,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:10,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 05:46:10,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:10,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:10,999 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-23 05:46:10,999 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [10], [12], [14], [23], [31], [34], [36], [38], [57], [62], [69], [71], [74], [77], [79], [81], [93], [103], [113], [116], [120], [123], [125], [127], [139], [149], [159], [162], [166], [168], [172], [174], [178], [180], [186], [192], [195], [197], [206], [208], [213], [219], [223], [231], [234], [236], [241], [243], [245], [247], [248], [253], [257], [273], [274], [275], [277] [2018-11-23 05:46:11,000 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:46:11,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:46:11,032 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:46:11,033 INFO L272 AbstractInterpreter]: Visited 61 different actions 126 times. Merged at 27 different actions 50 times. Never widened. Performed 478 root evaluator evaluations with a maximum evaluation depth of 4. Performed 478 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 9 different actions. Largest state had 22 variables. [2018-11-23 05:46:11,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:11,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:46:11,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:11,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:46:11,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:11,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:46:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:11,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:46:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:46:11,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:46:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:46:11,207 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:46:11,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 8 [2018-11-23 05:46:11,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:11,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:46:11,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:46:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:46:11,208 INFO L87 Difference]: Start difference. First operand 797 states and 1077 transitions. Second operand 4 states. [2018-11-23 05:46:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:11,563 INFO L93 Difference]: Finished difference Result 1633 states and 2317 transitions. [2018-11-23 05:46:11,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:46:11,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-23 05:46:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:11,565 INFO L225 Difference]: With dead ends: 1633 [2018-11-23 05:46:11,565 INFO L226 Difference]: Without dead ends: 1020 [2018-11-23 05:46:11,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:46:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-11-23 05:46:11,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 904. [2018-11-23 05:46:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 05:46:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1170 transitions. [2018-11-23 05:46:11,598 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1170 transitions. Word has length 66 [2018-11-23 05:46:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:11,598 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1170 transitions. [2018-11-23 05:46:11,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:46:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1170 transitions. [2018-11-23 05:46:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 05:46:11,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:11,600 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:11,600 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:11,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -183029461, now seen corresponding path program 1 times [2018-11-23 05:46:11,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:11,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:11,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:11,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 05:46:11,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:11,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 05:46:11,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:11,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:46:11,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:46:11,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:46:11,638 INFO L87 Difference]: Start difference. First operand 904 states and 1170 transitions. Second operand 3 states. [2018-11-23 05:46:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:11,666 INFO L93 Difference]: Finished difference Result 941 states and 1216 transitions. [2018-11-23 05:46:11,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:46:11,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-23 05:46:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:11,670 INFO L225 Difference]: With dead ends: 941 [2018-11-23 05:46:11,670 INFO L226 Difference]: Without dead ends: 880 [2018-11-23 05:46:11,670 INFO L631 BasicCegarLoop]: 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 [2018-11-23 05:46:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2018-11-23 05:46:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 854. [2018-11-23 05:46:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2018-11-23 05:46:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1101 transitions. [2018-11-23 05:46:11,703 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1101 transitions. Word has length 73 [2018-11-23 05:46:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:11,703 INFO L480 AbstractCegarLoop]: Abstraction has 854 states and 1101 transitions. [2018-11-23 05:46:11,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:46:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1101 transitions. [2018-11-23 05:46:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 05:46:11,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:11,705 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:11,705 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:11,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash -277234447, now seen corresponding path program 1 times [2018-11-23 05:46:11,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:11,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:11,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:11,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:11,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:46:11,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:11,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:46:11,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:11,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:46:11,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:46:11,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:46:11,754 INFO L87 Difference]: Start difference. First operand 854 states and 1101 transitions. Second operand 4 states. [2018-11-23 05:46:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:11,857 INFO L93 Difference]: Finished difference Result 2020 states and 2648 transitions. [2018-11-23 05:46:11,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:46:11,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-23 05:46:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:11,862 INFO L225 Difference]: With dead ends: 2020 [2018-11-23 05:46:11,862 INFO L226 Difference]: Without dead ends: 1410 [2018-11-23 05:46:11,864 INFO L631 BasicCegarLoop]: 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 [2018-11-23 05:46:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2018-11-23 05:46:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1096. [2018-11-23 05:46:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-11-23 05:46:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1460 transitions. [2018-11-23 05:46:11,906 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1460 transitions. Word has length 79 [2018-11-23 05:46:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:11,907 INFO L480 AbstractCegarLoop]: Abstraction has 1096 states and 1460 transitions. [2018-11-23 05:46:11,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:46:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1460 transitions. [2018-11-23 05:46:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 05:46:11,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:11,909 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-23 05:46:11,910 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:11,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:11,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1773749551, now seen corresponding path program 2 times [2018-11-23 05:46:11,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:11,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:11,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:11,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:11,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 05:46:12,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:12,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:46:12,010 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:46:12,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:46:12,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:46:12,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0c04cf5-8444-4ef0-a803-7f506cf95238/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:46:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:46:12,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:46:12,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 05:46:12,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:46:12,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:46:12,083 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 05:46:12,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:46:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 05:46:12,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:46:12,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2018-11-23 05:46:12,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:46:12,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:46:12,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:46:12,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:46:12,125 INFO L87 Difference]: Start difference. First operand 1096 states and 1460 transitions. Second operand 8 states. [2018-11-23 05:46:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:12,749 INFO L93 Difference]: Finished difference Result 4072 states and 5274 transitions. [2018-11-23 05:46:12,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 05:46:12,750 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-11-23 05:46:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:12,755 INFO L225 Difference]: With dead ends: 4072 [2018-11-23 05:46:12,755 INFO L226 Difference]: Without dead ends: 3190 [2018-11-23 05:46:12,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2018-11-23 05:46:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2018-11-23 05:46:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 1341. [2018-11-23 05:46:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-11-23 05:46:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1845 transitions. [2018-11-23 05:46:12,808 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1845 transitions. Word has length 79 [2018-11-23 05:46:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:12,808 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 1845 transitions. [2018-11-23 05:46:12,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:46:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1845 transitions. [2018-11-23 05:46:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 05:46:12,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:12,810 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:12,810 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:12,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash 315577703, now seen corresponding path program 1 times [2018-11-23 05:46:12,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:12,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:46:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:12,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 05:46:12,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:12,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 05:46:12,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:12,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:46:12,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:46:12,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:46:12,897 INFO L87 Difference]: Start difference. First operand 1341 states and 1845 transitions. Second operand 7 states. [2018-11-23 05:46:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:13,327 INFO L93 Difference]: Finished difference Result 3232 states and 4498 transitions. [2018-11-23 05:46:13,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:46:13,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-23 05:46:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:13,331 INFO L225 Difference]: With dead ends: 3232 [2018-11-23 05:46:13,331 INFO L226 Difference]: Without dead ends: 2661 [2018-11-23 05:46:13,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:46:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2018-11-23 05:46:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 1992. [2018-11-23 05:46:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2018-11-23 05:46:13,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2789 transitions. [2018-11-23 05:46:13,402 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2789 transitions. Word has length 85 [2018-11-23 05:46:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:13,402 INFO L480 AbstractCegarLoop]: Abstraction has 1992 states and 2789 transitions. [2018-11-23 05:46:13,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:46:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2789 transitions. [2018-11-23 05:46:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 05:46:13,404 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:13,404 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:13,405 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:13,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:13,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1216906630, now seen corresponding path program 1 times [2018-11-23 05:46:13,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:13,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:13,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:13,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 05:46:13,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:13,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 05:46:13,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:13,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:46:13,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:46:13,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:46:13,496 INFO L87 Difference]: Start difference. First operand 1992 states and 2789 transitions. Second operand 8 states. [2018-11-23 05:46:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:14,100 INFO L93 Difference]: Finished difference Result 4666 states and 6569 transitions. [2018-11-23 05:46:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 05:46:14,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-11-23 05:46:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:14,105 INFO L225 Difference]: With dead ends: 4666 [2018-11-23 05:46:14,105 INFO L226 Difference]: Without dead ends: 3463 [2018-11-23 05:46:14,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:46:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2018-11-23 05:46:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 2630. [2018-11-23 05:46:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-11-23 05:46:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3697 transitions. [2018-11-23 05:46:14,268 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3697 transitions. Word has length 88 [2018-11-23 05:46:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:14,268 INFO L480 AbstractCegarLoop]: Abstraction has 2630 states and 3697 transitions. [2018-11-23 05:46:14,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:46:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3697 transitions. [2018-11-23 05:46:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 05:46:14,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:14,271 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:14,271 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:14,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1107684138, now seen corresponding path program 1 times [2018-11-23 05:46:14,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:14,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:14,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:14,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:14,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 05:46:14,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:14,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 05:46:14,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:14,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:46:14,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:46:14,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:46:14,352 INFO L87 Difference]: Start difference. First operand 2630 states and 3697 transitions. Second operand 8 states. [2018-11-23 05:46:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:14,990 INFO L93 Difference]: Finished difference Result 7663 states and 10942 transitions. [2018-11-23 05:46:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:46:14,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-11-23 05:46:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:14,994 INFO L225 Difference]: With dead ends: 7663 [2018-11-23 05:46:14,994 INFO L226 Difference]: Without dead ends: 4099 [2018-11-23 05:46:14,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:46:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2018-11-23 05:46:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 3115. [2018-11-23 05:46:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2018-11-23 05:46:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4365 transitions. [2018-11-23 05:46:15,123 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4365 transitions. Word has length 88 [2018-11-23 05:46:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:15,123 INFO L480 AbstractCegarLoop]: Abstraction has 3115 states and 4365 transitions. [2018-11-23 05:46:15,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:46:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4365 transitions. [2018-11-23 05:46:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 05:46:15,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:15,125 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:15,126 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:15,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1919875554, now seen corresponding path program 1 times [2018-11-23 05:46:15,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:15,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:15,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:15,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 05:46:15,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:15,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:46:15,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:15,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:46:15,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:46:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:46:15,226 INFO L87 Difference]: Start difference. First operand 3115 states and 4365 transitions. Second operand 9 states. [2018-11-23 05:46:15,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:15,770 INFO L93 Difference]: Finished difference Result 4003 states and 5502 transitions. [2018-11-23 05:46:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:46:15,771 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-11-23 05:46:15,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:15,774 INFO L225 Difference]: With dead ends: 4003 [2018-11-23 05:46:15,775 INFO L226 Difference]: Without dead ends: 2823 [2018-11-23 05:46:15,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:46:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2018-11-23 05:46:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2520. [2018-11-23 05:46:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2520 states. [2018-11-23 05:46:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3504 transitions. [2018-11-23 05:46:15,910 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3504 transitions. Word has length 90 [2018-11-23 05:46:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:15,910 INFO L480 AbstractCegarLoop]: Abstraction has 2520 states and 3504 transitions. [2018-11-23 05:46:15,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:46:15,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3504 transitions. [2018-11-23 05:46:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 05:46:15,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:15,911 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:15,912 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:15,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1198243630, now seen corresponding path program 1 times [2018-11-23 05:46:15,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:15,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:15,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:15,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:15,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:46:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-23 05:46:16,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:46:16,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 05:46:16,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:46:16,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:46:16,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:46:16,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:46:16,081 INFO L87 Difference]: Start difference. First operand 2520 states and 3504 transitions. Second operand 9 states. [2018-11-23 05:46:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:46:16,529 INFO L93 Difference]: Finished difference Result 3205 states and 4413 transitions. [2018-11-23 05:46:16,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:46:16,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-11-23 05:46:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:46:16,532 INFO L225 Difference]: With dead ends: 3205 [2018-11-23 05:46:16,532 INFO L226 Difference]: Without dead ends: 1627 [2018-11-23 05:46:16,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:46:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2018-11-23 05:46:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1541. [2018-11-23 05:46:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2018-11-23 05:46:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2116 transitions. [2018-11-23 05:46:16,621 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2116 transitions. Word has length 90 [2018-11-23 05:46:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:46:16,621 INFO L480 AbstractCegarLoop]: Abstraction has 1541 states and 2116 transitions. [2018-11-23 05:46:16,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:46:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2116 transitions. [2018-11-23 05:46:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 05:46:16,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:46:16,623 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:46:16,623 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mp_addErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr22ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr24ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr30ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr36ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr27ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr19ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr21ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr17ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr34ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr33ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr32ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr35ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr28ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr26ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr23ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr31ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr16ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr37ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr18ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr20ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr25ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr29ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mp_addErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 05:46:16,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:46:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2132168340, now seen corresponding path program 1 times [2018-11-23 05:46:16,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:46:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:46:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:46:16,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:46:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:46:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:46:16,676 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #274#return; [?] CALL call #t~ret3 := main(); [?] havoc ~a~0;havoc ~b~0;havoc ~r~1;~a~0 := #t~nondet0;havoc #t~nondet0;~b~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~a~0=0, main_~b~0=(- 2147483649)] [?] CALL call #t~ret2 := mp_add(~a~0, ~b~0); VAL [|mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] ~a := #in~a;~b := #in~b;havoc ~a0~0;havoc ~a1~0;havoc ~a2~0;havoc ~a3~0;havoc ~b0~0;havoc ~b1~0;havoc ~b2~0;havoc ~b3~0;havoc ~r0~0;havoc ~r1~0;havoc ~r2~0;havoc ~r3~0;havoc ~carry~0;havoc ~partial_sum~0;havoc ~r~0;havoc ~i~0;havoc ~na~0;havoc ~nb~0;~a0~0 := ~a;~a1~0 := ~a / 256;~a2~0 := ~a / 65536;~a3~0 := ~a / 16777216;~b0~0 := ~b;~b1~0 := ~b / 256;~b2~0 := ~b / 65536;~b3~0 := ~b / 16777216;~na~0 := 4; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=4, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 0 == ~a3~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=4, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~na~0 % 256 - 1 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=4, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~na~0 % 256 - 1 >= -2147483648;~na~0 := ~na~0 % 256 - 1; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=3, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 0 == ~a2~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=3, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~na~0 % 256 - 1 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=3, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~na~0 % 256 - 1 >= -2147483648;~na~0 := ~na~0 % 256 - 1; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=2, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 0 == ~a1~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=2, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~na~0 % 256 - 1 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=2, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~na~0 % 256 - 1 >= -2147483648;~na~0 := ~na~0 % 256 - 1; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] ~nb~0 := 4; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=1, mp_add_~nb~0=4, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(0 == ~b3~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~na~0=1, mp_add_~nb~0=4, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] ~carry~0 := 0;~i~0 := 0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536);~partial_sum~0 := ~carry~0;~carry~0 := 0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~i~0 % 256 < ~na~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 0 == ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~a0~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~a0~0 % 256 >= -2147483648;~partial_sum~0 := ~partial_sum~0 % 65536 + ~a0~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(1 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(2 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(3 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~i~0 % 256 < ~nb~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 0 == ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~b0~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~b0~0 % 256 >= -2147483648;~partial_sum~0 := ~partial_sum~0 % 65536 + ~b0~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=255, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(1 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=255, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(2 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=255, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(3 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=255, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 > 254;~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255);~carry~0 := 1; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 0 == ~i~0 % 256;~r0~0 := ~partial_sum~0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(1 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(2 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(3 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 + ~i~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=0, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 + ~i~0 % 256 >= -2147483648;~i~0 := 1 + ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536);~partial_sum~0 := ~carry~0;~carry~0 := 0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(~i~0 % 256 < ~na~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~i~0 % 256 < ~nb~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(0 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 == ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~b1~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~b1~0 % 256 >= -2147483648;~partial_sum~0 := ~partial_sum~0 % 65536 + ~b1~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=256, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(2 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=256, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(3 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=256, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 > 254;~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255);~carry~0 := 1; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(0 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~r0~0=1, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 == ~i~0 % 256;~r1~0 := ~partial_sum~0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(2 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(3 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 + ~i~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=1, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 + ~i~0 % 256 >= -2147483648;~i~0 := 1 + ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536);~partial_sum~0 := ~carry~0;~carry~0 := 0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(~i~0 % 256 < ~na~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~i~0 % 256 < ~nb~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(0 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(1 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 2 == ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~b2~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~b2~0 % 256 >= -2147483648;~partial_sum~0 := ~partial_sum~0 % 65536 + ~b2~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=256, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(3 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=256, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 > 254;~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255);~carry~0 := 1; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(0 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(1 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~r0~0=1, mp_add_~r1~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 2 == ~i~0 % 256;~r2~0 := ~partial_sum~0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(3 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 + ~i~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=2, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 + ~i~0 % 256 >= -2147483648;~i~0 := 1 + ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=1, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=0, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536);~partial_sum~0 := ~carry~0;~carry~0 := 0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(~i~0 % 256 < ~na~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~i~0 % 256 < ~nb~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(0 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(1 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(2 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 3 == ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~b3~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=1, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume ~partial_sum~0 % 65536 + ~b3~0 % 256 >= -2147483648;~partial_sum~0 := ~partial_sum~0 % 65536 + ~b3~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(~partial_sum~0 % 65536 > 254); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(0 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(1 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(2 == ~i~0 % 256); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 3 == ~i~0 % 256;~r3~0 := ~partial_sum~0; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 + ~i~0 % 256 <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=3, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 1 + ~i~0 % 256 >= -2147483648;~i~0 := 1 + ~i~0 % 256; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=4, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=4, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(~i~0 % 256 < 4); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=4, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 256 * (~r1~0 % 256) <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=4, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 256 * (~r1~0 % 256) >= -2147483648; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=4, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 65536 * (~r2~0 % 256) <= 2147483647; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=4, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume 65536 * (~r2~0 % 256) >= -2147483648; VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=4, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] assume !(16777216 * (~r3~0 % 256) <= 2147483647); VAL [mp_add_~a=0, mp_add_~a0~0=0, mp_add_~a1~0=0, mp_add_~a2~0=0, mp_add_~a3~0=0, mp_add_~b=(- 2147483649), mp_add_~b0~0=(- 2147483649), mp_add_~b1~0=(- 8388609), mp_add_~b2~0=(- 32769), mp_add_~b3~0=(- 129), mp_add_~carry~0=0, mp_add_~i~0=4, mp_add_~na~0=1, mp_add_~nb~0=4, mp_add_~partial_sum~0=128, mp_add_~r0~0=1, mp_add_~r1~0=0, mp_add_~r2~0=0, mp_add_~r3~0=128, |mp_add_#in~a|=0, |mp_add_#in~b|=(- 2147483649)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L105] havoc ~a~0; [L105] havoc ~b~0; [L105] havoc ~r~1; [L107] ~a~0 := #t~nondet0; [L107] havoc #t~nondet0; [L108] ~b~0 := #t~nondet1; [L108] havoc #t~nondet1; VAL [~a~0=0, ~b~0=-2147483649] [L110] CALL call #t~ret2 := mp_add(~a~0, ~b~0); VAL [#in~a=0, #in~b=-2147483649] [L21-L100] ~a := #in~a; [L21-L100] ~b := #in~b; [L23] havoc ~a0~0; [L23] havoc ~a1~0; [L23] havoc ~a2~0; [L23] havoc ~a3~0; [L24] havoc ~b0~0; [L24] havoc ~b1~0; [L24] havoc ~b2~0; [L24] havoc ~b3~0; [L25] havoc ~r0~0; [L25] havoc ~r1~0; [L25] havoc ~r2~0; [L25] havoc ~r3~0; [L26] havoc ~carry~0; [L27] havoc ~partial_sum~0; [L28] havoc ~r~0; [L29] havoc ~i~0; [L30] havoc ~na~0; [L30] havoc ~nb~0; [L31] ~a0~0 := ~a; [L32] ~a1~0 := ~a / 256; [L33] ~a2~0 := ~a / 65536; [L34] ~a3~0 := ~a / 16777216; [L35] ~b0~0 := ~b; [L36] ~b1~0 := ~b / 256; [L37] ~b2~0 := ~b / 65536; [L38] ~b3~0 := ~b / 16777216; [L39] ~na~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L40-L48] assume 0 == ~a3~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 >= -2147483648; [L41] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L42-L47] assume 0 == ~a2~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 >= -2147483648; [L43] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L44-L46] assume 0 == ~a1~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 >= -2147483648; [L45] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1] [L49] ~nb~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L50-L58] assume !(0 == ~b3~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L59] ~carry~0 := 0; [L60] ~i~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4] [L61-L86] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L64-L69] assume ~i~0 % 256 < ~na~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assume 0 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 >= -2147483648; [L65] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~a0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L66] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L67] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L68] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L70-L75] assume ~i~0 % 256 < ~nb~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assume 0 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 >= -2147483648; [L71] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L72] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L73] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L74] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L76-L79] assume ~partial_sum~0 % 65536 > 254; [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4] [L80] assume 0 == ~i~0 % 256; [L80] ~r0~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L81] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L82] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L83] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L61-L86] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L64-L69] assume !(~i~0 % 256 < ~na~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L70-L75] assume ~i~0 % 256 < ~nb~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L71] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assume 1 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 >= -2147483648; [L72] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b1~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L73] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L74] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L76-L79] assume ~partial_sum~0 % 65536 > 254; [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L80] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L81] assume 1 == ~i~0 % 256; [L81] ~r1~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L82] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L83] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L61-L86] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L64-L69] assume !(~i~0 % 256 < ~na~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L70-L75] assume ~i~0 % 256 < ~nb~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L71] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L72] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assume 2 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 >= -2147483648; [L73] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b2~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L74] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L76-L79] assume ~partial_sum~0 % 65536 > 254; [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L80] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L81] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L82] assume 2 == ~i~0 % 256; [L82] ~r2~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L61-L86] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L64-L69] assume !(~i~0 % 256 < ~na~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L70-L75] assume ~i~0 % 256 < ~nb~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L71] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L72] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L73] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assume 3 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 >= -2147483648; [L74] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b3~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L76-L79] assume !(~partial_sum~0 % 65536 > 254); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L80] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L81] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L82] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] assume 3 == ~i~0 % 256; [L83] ~r3~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L61-L86] assume !((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L88-L95] assume !(~i~0 % 256 < 4); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 16777216 * (~r3~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L105] havoc ~a~0; [L105] havoc ~b~0; [L105] havoc ~r~1; [L107] ~a~0 := #t~nondet0; [L107] havoc #t~nondet0; [L108] ~b~0 := #t~nondet1; [L108] havoc #t~nondet1; VAL [~a~0=0, ~b~0=-2147483649] [L110] CALL call #t~ret2 := mp_add(~a~0, ~b~0); VAL [#in~a=0, #in~b=-2147483649] [L21-L100] ~a := #in~a; [L21-L100] ~b := #in~b; [L23] havoc ~a0~0; [L23] havoc ~a1~0; [L23] havoc ~a2~0; [L23] havoc ~a3~0; [L24] havoc ~b0~0; [L24] havoc ~b1~0; [L24] havoc ~b2~0; [L24] havoc ~b3~0; [L25] havoc ~r0~0; [L25] havoc ~r1~0; [L25] havoc ~r2~0; [L25] havoc ~r3~0; [L26] havoc ~carry~0; [L27] havoc ~partial_sum~0; [L28] havoc ~r~0; [L29] havoc ~i~0; [L30] havoc ~na~0; [L30] havoc ~nb~0; [L31] ~a0~0 := ~a; [L32] ~a1~0 := ~a / 256; [L33] ~a2~0 := ~a / 65536; [L34] ~a3~0 := ~a / 16777216; [L35] ~b0~0 := ~b; [L36] ~b1~0 := ~b / 256; [L37] ~b2~0 := ~b / 65536; [L38] ~b3~0 := ~b / 16777216; [L39] ~na~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L40-L48] assume 0 == ~a3~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 >= -2147483648; [L41] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L42-L47] assume 0 == ~a2~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 >= -2147483648; [L43] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L44-L46] assume 0 == ~a1~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 >= -2147483648; [L45] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1] [L49] ~nb~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L50-L58] assume !(0 == ~b3~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L59] ~carry~0 := 0; [L60] ~i~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4] [L61-L86] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L64-L69] assume ~i~0 % 256 < ~na~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assume 0 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 >= -2147483648; [L65] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~a0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L66] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L67] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L68] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L70-L75] assume ~i~0 % 256 < ~nb~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assume 0 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 >= -2147483648; [L71] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L72] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L73] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L74] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L76-L79] assume ~partial_sum~0 % 65536 > 254; [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4] [L80] assume 0 == ~i~0 % 256; [L80] ~r0~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L81] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L82] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L83] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L61-L86] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L64-L69] assume !(~i~0 % 256 < ~na~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L70-L75] assume ~i~0 % 256 < ~nb~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L71] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assume 1 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 >= -2147483648; [L72] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b1~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L73] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L74] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L76-L79] assume ~partial_sum~0 % 65536 > 254; [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L80] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L81] assume 1 == ~i~0 % 256; [L81] ~r1~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L82] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L83] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L61-L86] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L64-L69] assume !(~i~0 % 256 < ~na~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L70-L75] assume ~i~0 % 256 < ~nb~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L71] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L72] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assume 2 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 >= -2147483648; [L73] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b2~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L74] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L76-L79] assume ~partial_sum~0 % 65536 > 254; [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L80] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L81] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L82] assume 2 == ~i~0 % 256; [L82] ~r2~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] assume !(3 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L61-L86] assume !!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L64-L69] assume !(~i~0 % 256 < ~na~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L70-L75] assume ~i~0 % 256 < ~nb~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L71] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L72] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L73] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assume 3 == ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 >= -2147483648; [L74] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b3~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L76-L79] assume !(~partial_sum~0 % 65536 > 254); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L80] assume !(0 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L81] assume !(1 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L82] assume !(2 == ~i~0 % 256); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] assume 3 == ~i~0 % 256; [L83] ~r3~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L61-L86] assume !((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L88-L95] assume !(~i~0 % 256 < 4); VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 16777216 * (~r3~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L105] havoc ~a~0; [L105] havoc ~b~0; [L105] havoc ~r~1; [L107] ~a~0 := #t~nondet0; [L107] havoc #t~nondet0; [L108] ~b~0 := #t~nondet1; [L108] havoc #t~nondet1; VAL [~a~0=0, ~b~0=-2147483649] [L110] CALL call #t~ret2 := mp_add(~a~0, ~b~0); VAL [#in~a=0, #in~b=-2147483649] [L21-L100] ~a := #in~a; [L21-L100] ~b := #in~b; [L23] havoc ~a0~0; [L23] havoc ~a1~0; [L23] havoc ~a2~0; [L23] havoc ~a3~0; [L24] havoc ~b0~0; [L24] havoc ~b1~0; [L24] havoc ~b2~0; [L24] havoc ~b3~0; [L25] havoc ~r0~0; [L25] havoc ~r1~0; [L25] havoc ~r2~0; [L25] havoc ~r3~0; [L26] havoc ~carry~0; [L27] havoc ~partial_sum~0; [L28] havoc ~r~0; [L29] havoc ~i~0; [L30] havoc ~na~0; [L30] havoc ~nb~0; [L31] ~a0~0 := ~a; [L32] ~a1~0 := ~a / 256; [L33] ~a2~0 := ~a / 65536; [L34] ~a3~0 := ~a / 16777216; [L35] ~b0~0 := ~b; [L36] ~b1~0 := ~b / 256; [L37] ~b2~0 := ~b / 65536; [L38] ~b3~0 := ~b / 16777216; [L39] ~na~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L40] COND TRUE 0 == ~a3~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 >= -2147483648; [L41] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L42] COND TRUE 0 == ~a2~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 >= -2147483648; [L43] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L44] COND TRUE 0 == ~a1~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 >= -2147483648; [L45] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1] [L49] ~nb~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L50] COND FALSE !(0 == ~b3~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L59] ~carry~0 := 0; [L60] ~i~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L64] COND TRUE ~i~0 % 256 < ~na~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] COND TRUE 0 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 >= -2147483648; [L65] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~a0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L66] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L67] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L68] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] COND TRUE 0 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 >= -2147483648; [L71] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4] [L80] COND TRUE 0 == ~i~0 % 256 [L80] ~r0~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] COND TRUE 1 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 >= -2147483648; [L72] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b1~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L81] COND TRUE 1 == ~i~0 % 256 [L81] ~r1~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] COND TRUE 2 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 >= -2147483648; [L73] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b2~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L82] COND TRUE 2 == ~i~0 % 256 [L82] ~r2~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] COND TRUE 3 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 >= -2147483648; [L74] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b3~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L76] COND FALSE !(~partial_sum~0 % 65536 > 254) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] COND TRUE 3 == ~i~0 % 256 [L83] ~r3~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L61-L86] COND TRUE !((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L88-L95] COND TRUE !(~i~0 % 256 < 4) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 16777216 * (~r3~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L105] havoc ~a~0; [L105] havoc ~b~0; [L105] havoc ~r~1; [L107] ~a~0 := #t~nondet0; [L107] havoc #t~nondet0; [L108] ~b~0 := #t~nondet1; [L108] havoc #t~nondet1; VAL [~a~0=0, ~b~0=-2147483649] [L110] CALL call #t~ret2 := mp_add(~a~0, ~b~0); VAL [#in~a=0, #in~b=-2147483649] [L21-L100] ~a := #in~a; [L21-L100] ~b := #in~b; [L23] havoc ~a0~0; [L23] havoc ~a1~0; [L23] havoc ~a2~0; [L23] havoc ~a3~0; [L24] havoc ~b0~0; [L24] havoc ~b1~0; [L24] havoc ~b2~0; [L24] havoc ~b3~0; [L25] havoc ~r0~0; [L25] havoc ~r1~0; [L25] havoc ~r2~0; [L25] havoc ~r3~0; [L26] havoc ~carry~0; [L27] havoc ~partial_sum~0; [L28] havoc ~r~0; [L29] havoc ~i~0; [L30] havoc ~na~0; [L30] havoc ~nb~0; [L31] ~a0~0 := ~a; [L32] ~a1~0 := ~a / 256; [L33] ~a2~0 := ~a / 65536; [L34] ~a3~0 := ~a / 16777216; [L35] ~b0~0 := ~b; [L36] ~b1~0 := ~b / 256; [L37] ~b2~0 := ~b / 65536; [L38] ~b3~0 := ~b / 16777216; [L39] ~na~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L40] COND TRUE 0 == ~a3~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 >= -2147483648; [L41] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L42] COND TRUE 0 == ~a2~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 >= -2147483648; [L43] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L44] COND TRUE 0 == ~a1~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 >= -2147483648; [L45] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1] [L49] ~nb~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L50] COND FALSE !(0 == ~b3~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L59] ~carry~0 := 0; [L60] ~i~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L64] COND TRUE ~i~0 % 256 < ~na~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] COND TRUE 0 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 >= -2147483648; [L65] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~a0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L66] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L67] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L68] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] COND TRUE 0 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 >= -2147483648; [L71] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4] [L80] COND TRUE 0 == ~i~0 % 256 [L80] ~r0~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] COND TRUE 1 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 >= -2147483648; [L72] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b1~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L81] COND TRUE 1 == ~i~0 % 256 [L81] ~r1~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] COND TRUE 2 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 >= -2147483648; [L73] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b2~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L82] COND TRUE 2 == ~i~0 % 256 [L82] ~r2~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] COND TRUE 3 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 >= -2147483648; [L74] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b3~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L76] COND FALSE !(~partial_sum~0 % 65536 > 254) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] COND TRUE 3 == ~i~0 % 256 [L83] ~r3~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L61-L86] COND TRUE !((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L88-L95] COND TRUE !(~i~0 % 256 < 4) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 16777216 * (~r3~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L105] havoc ~a~0; [L105] havoc ~b~0; [L105] havoc ~r~1; [L107] ~a~0 := #t~nondet0; [L107] havoc #t~nondet0; [L108] ~b~0 := #t~nondet1; [L108] havoc #t~nondet1; VAL [~a~0=0, ~b~0=-2147483649] [L110] CALL call #t~ret2 := mp_add(~a~0, ~b~0); VAL [#in~a=0, #in~b=-2147483649] [L21-L100] ~a := #in~a; [L21-L100] ~b := #in~b; [L23] havoc ~a0~0; [L23] havoc ~a1~0; [L23] havoc ~a2~0; [L23] havoc ~a3~0; [L24] havoc ~b0~0; [L24] havoc ~b1~0; [L24] havoc ~b2~0; [L24] havoc ~b3~0; [L25] havoc ~r0~0; [L25] havoc ~r1~0; [L25] havoc ~r2~0; [L25] havoc ~r3~0; [L26] havoc ~carry~0; [L27] havoc ~partial_sum~0; [L28] havoc ~r~0; [L29] havoc ~i~0; [L30] havoc ~na~0; [L30] havoc ~nb~0; [L31] ~a0~0 := ~a; [L32] ~a1~0 := ~a / 256; [L33] ~a2~0 := ~a / 65536; [L34] ~a3~0 := ~a / 16777216; [L35] ~b0~0 := ~b; [L36] ~b1~0 := ~b / 256; [L37] ~b2~0 := ~b / 65536; [L38] ~b3~0 := ~b / 16777216; [L39] ~na~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L40] COND TRUE 0 == ~a3~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 >= -2147483648; [L41] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L42] COND TRUE 0 == ~a2~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 >= -2147483648; [L43] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L44] COND TRUE 0 == ~a1~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 >= -2147483648; [L45] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1] [L49] ~nb~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L50] COND FALSE !(0 == ~b3~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L59] ~carry~0 := 0; [L60] ~i~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L64] COND TRUE ~i~0 % 256 < ~na~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] COND TRUE 0 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 >= -2147483648; [L65] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~a0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L66] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L67] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L68] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] COND TRUE 0 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 >= -2147483648; [L71] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4] [L80] COND TRUE 0 == ~i~0 % 256 [L80] ~r0~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] COND TRUE 1 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 >= -2147483648; [L72] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b1~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L81] COND TRUE 1 == ~i~0 % 256 [L81] ~r1~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] COND TRUE 2 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 >= -2147483648; [L73] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b2~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L82] COND TRUE 2 == ~i~0 % 256 [L82] ~r2~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] COND TRUE 3 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 >= -2147483648; [L74] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b3~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L76] COND FALSE !(~partial_sum~0 % 65536 > 254) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] COND TRUE 3 == ~i~0 % 256 [L83] ~r3~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L61-L86] COND TRUE !((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L88-L95] COND TRUE !(~i~0 % 256 < 4) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 16777216 * (~r3~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L105] havoc ~a~0; [L105] havoc ~b~0; [L105] havoc ~r~1; [L107] ~a~0 := #t~nondet0; [L107] havoc #t~nondet0; [L108] ~b~0 := #t~nondet1; [L108] havoc #t~nondet1; VAL [~a~0=0, ~b~0=-2147483649] [L110] CALL call #t~ret2 := mp_add(~a~0, ~b~0); VAL [#in~a=0, #in~b=-2147483649] [L21-L100] ~a := #in~a; [L21-L100] ~b := #in~b; [L23] havoc ~a0~0; [L23] havoc ~a1~0; [L23] havoc ~a2~0; [L23] havoc ~a3~0; [L24] havoc ~b0~0; [L24] havoc ~b1~0; [L24] havoc ~b2~0; [L24] havoc ~b3~0; [L25] havoc ~r0~0; [L25] havoc ~r1~0; [L25] havoc ~r2~0; [L25] havoc ~r3~0; [L26] havoc ~carry~0; [L27] havoc ~partial_sum~0; [L28] havoc ~r~0; [L29] havoc ~i~0; [L30] havoc ~na~0; [L30] havoc ~nb~0; [L31] ~a0~0 := ~a; [L32] ~a1~0 := ~a / 256; [L33] ~a2~0 := ~a / 65536; [L34] ~a3~0 := ~a / 16777216; [L35] ~b0~0 := ~b; [L36] ~b1~0 := ~b / 256; [L37] ~b2~0 := ~b / 65536; [L38] ~b3~0 := ~b / 16777216; [L39] ~na~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L40] COND TRUE 0 == ~a3~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=4] [L41] assert ~na~0 % 256 - 1 >= -2147483648; [L41] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L42] COND TRUE 0 == ~a2~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=3] [L43] assert ~na~0 % 256 - 1 >= -2147483648; [L43] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L44] COND TRUE 0 == ~a1~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=2] [L45] assert ~na~0 % 256 - 1 >= -2147483648; [L45] ~na~0 := ~na~0 % 256 - 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1] [L49] ~nb~0 := 4; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L50] COND FALSE !(0 == ~b3~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~na~0=1, ~nb~0=4] [L59] ~carry~0 := 0; [L60] ~i~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L64] COND TRUE ~i~0 % 256 < ~na~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] COND TRUE 0 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L65] assert ~partial_sum~0 % 65536 + ~a0~0 % 256 >= -2147483648; [L65] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~a0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L66] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L67] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L68] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] COND TRUE 0 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=0] [L71] assert ~partial_sum~0 % 65536 + ~b0~0 % 256 >= -2147483648; [L71] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b0~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=255] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4] [L80] COND TRUE 0 == ~i~0 % 256 [L80] ~r0~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=0, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] COND TRUE 1 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1] [L72] assert ~partial_sum~0 % 65536 + ~b1~0 % 256 >= -2147483648; [L72] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b1~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~r0~0=1] [L81] COND TRUE 1 == ~i~0 % 256 [L81] ~r1~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=1, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] COND TRUE 2 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0] [L73] assert ~partial_sum~0 % 65536 + ~b2~0 % 256 >= -2147483648; [L73] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b2~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L74] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=256, ~r0~0=1, ~r1~0=0] [L76] COND TRUE ~partial_sum~0 % 65536 > 254 [L77] ~partial_sum~0 := ~bitwiseAnd(~partial_sum~0 % 65536, 255); [L78] ~carry~0 := 1; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~r0~0=1, ~r1~0=0] [L82] COND TRUE 2 == ~i~0 % 256 [L82] ~r2~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] COND FALSE !(3 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=2, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=1, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=0, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L61-L86] COND FALSE !(!((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536)) [L62] ~partial_sum~0 := ~carry~0; [L63] ~carry~0 := 0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L64] COND FALSE !(~i~0 % 256 < ~na~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L70] COND TRUE ~i~0 % 256 < ~nb~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L71] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L72] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L73] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] COND TRUE 3 == ~i~0 % 256 VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=1, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L74] assert ~partial_sum~0 % 65536 + ~b3~0 % 256 >= -2147483648; [L74] ~partial_sum~0 := ~partial_sum~0 % 65536 + ~b3~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L76] COND FALSE !(~partial_sum~0 % 65536 > 254) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L80] COND FALSE !(0 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L81] COND FALSE !(1 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L82] COND FALSE !(2 == ~i~0 % 256) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0] [L83] COND TRUE 3 == ~i~0 % 256 [L83] ~r3~0 := ~partial_sum~0; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=3, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L85] assert 1 + ~i~0 % 256 >= -2147483648; [L85] ~i~0 := 1 + ~i~0 % 256; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L61-L86] COND TRUE !((~i~0 % 256 < ~na~0 % 256 || ~i~0 % 256 < ~nb~0 % 256) || 0 != ~carry~0 % 65536) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L88-L95] COND TRUE !(~i~0 % 256 < 4) VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 256 * (~r1~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 65536 * (~r2~0 % 256) >= -2147483648; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L97] assert 16777216 * (~r3~0 % 256) <= 2147483647; VAL [#in~a=0, #in~b=-2147483649, ~a=0, ~a0~0=0, ~a1~0=0, ~a2~0=0, ~a3~0=0, ~b=-2147483649, ~b0~0=-2147483649, ~b1~0=-8388609, ~b2~0=-32769, ~b3~0=-129, ~carry~0=0, ~i~0=4, ~na~0=1, ~nb~0=4, ~partial_sum~0=128, ~r0~0=1, ~r1~0=0, ~r2~0=0, ~r3~0=128] [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL mp_add(a, b) VAL [\old(a)=0, \old(b)=2147483647] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L40] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L41] EXPR na - 1 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L42] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L43] EXPR na - 1 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L44] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L45] EXPR na - 1 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=1, r0=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=3, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] ----- [2018-11-23 05:46:17,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:46:17 BoogieIcfgContainer [2018-11-23 05:46:17,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:46:17,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:46:17,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:46:17,454 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:46:17,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:55" (3/4) ... [2018-11-23 05:46:17,457 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:46:17,458 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:46:17,458 INFO L168 Benchmark]: Toolchain (without parser) took 22883.77 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 430.4 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -97.0 MB). Peak memory consumption was 333.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:46:17,459 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:46:17,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.70 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:46:17,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.07 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:46:17,460 INFO L168 Benchmark]: Boogie Preprocessor took 61.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:46:17,461 INFO L168 Benchmark]: RCFGBuilder took 364.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:46:17,461 INFO L168 Benchmark]: TraceAbstraction took 22232.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.3 MB). Peak memory consumption was 338.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:46:17,461 INFO L168 Benchmark]: Witness Printer took 17.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:46:17,463 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 185.70 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.07 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22232.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.3 MB). Peak memory consumption was 338.6 MB. Max. memory is 11.5 GB. * Witness Printer took 17.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 97]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL mp_add(a, b) VAL [\old(a)=0, \old(b)=2147483647] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L40] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=4] [L41] EXPR na - 1 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L42] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=3] [L43] EXPR na - 1 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L44] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=2] [L45] EXPR na - 1 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L50] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, na=1, nb=4] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L65] EXPR partial_sum + a0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=0] [L71] EXPR partial_sum + b0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=0, na=1, nb=4, partial_sum=255] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=0, na=1, nb=4, partial_sum=1, r0=1] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=1, r0=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] COND TRUE i == (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=1] [L72] EXPR partial_sum + b1 [L72] partial_sum = partial_sum + b1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=1] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, r0=1] [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] COND TRUE i == (unsigned char)2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=1, r1=0] [L73] EXPR partial_sum + b2 [L73] partial_sum = partial_sum + b2 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=1, r1=0] [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, r0=1, r1=0] [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=1, i=3, na=1, nb=4, partial_sum=0, r0=1, r1=0, r2=0] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L64] COND FALSE !(i < na) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L71] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] COND TRUE i == (unsigned char)3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=1, r1=0, r2=0] [L74] EXPR partial_sum + b3 [L74] partial_sum = partial_sum + b3 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0] [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L85] EXPR i + (unsigned char)1 [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r1 << 8U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r2 << 16U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] [L97] r3 << 24U VAL [\old(a)=0, \old(b)=2147483647, a=0, a0=0, a1=0, a2=0, a3=0, b=2147483647, b0=-2147483649, b1=-8388609, b2=-32769, b3=-129, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=1, r1=0, r2=0, r3=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 126 locations, 38 error locations. UNSAFE Result, 22.1s OverallTime, 36 OverallIterations, 4 TraceHistogramMax, 15.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7862 SDtfs, 12445 SDslu, 26472 SDs, 0 SdLazy, 11062 SolverSat, 721 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 34 DeclaredPredicates, 1386 GetRequests, 1126 SyntacticMatches, 7 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3115occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 18 AbstIntIterations, 17 AbstIntStrong, 0.9869894917909937 AbsIntWeakeningRatio, 0.5761802575107297 AbsIntAvgWeakeningVarsNumRemoved, 1.4645922746781115 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 19205 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2249 NumberOfCodeBlocks, 2223 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2259 ConstructedInterpolants, 1 QuantifiedInterpolants, 402005 SizeOfPredicates, 3 NumberOfNonLiveVariables, 275 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 39 InterpolantComputations, 18 PerfectInterpolantSequences, 1049/1143 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...