java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/heavy_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:16:03,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:16:03,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:16:03,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:16:03,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:16:03,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:16:03,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:16:03,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:16:03,276 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:16:03,277 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:16:03,278 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:16:03,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:16:03,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:16:03,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:16:03,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:16:03,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:16:03,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:16:03,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:16:03,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:16:03,290 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:16:03,291 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:16:03,292 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:16:03,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:16:03,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:16:03,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:16:03,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:16:03,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:16:03,303 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:16:03,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:16:03,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:16:03,306 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:16:03,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:16:03,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:16:03,307 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:16:03,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:16:03,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:16:03,309 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:16:03,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:16:03,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:16:03,333 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:16:03,333 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:16:03,334 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:16:03,334 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:16:03,334 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:16:03,334 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:16:03,334 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:16:03,335 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:16:03,335 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:16:03,335 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:16:03,335 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:16:03,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:16:03,336 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:16:03,336 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:16:03,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:16:03,336 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:16:03,336 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:16:03,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:16:03,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:16:03,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:16:03,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:16:03,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:03,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:16:03,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:16:03,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:16:03,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:16:03,339 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:16:03,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:16:03,339 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:16:03,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:16:03,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:16:03,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:16:03,413 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:16:03,414 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:16:03,414 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy_false-unreach-call.c [2018-11-23 13:16:03,496 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb40033d/a1ebe4b13e1045f8bad365219af35715/FLAG32f2c2a71 [2018-11-23 13:16:03,990 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:16:03,991 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy_false-unreach-call.c [2018-11-23 13:16:03,997 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb40033d/a1ebe4b13e1045f8bad365219af35715/FLAG32f2c2a71 [2018-11-23 13:16:04,320 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beb40033d/a1ebe4b13e1045f8bad365219af35715 [2018-11-23 13:16:04,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:16:04,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:16:04,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:04,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:16:04,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:16:04,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717d65bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04, skipping insertion in model container [2018-11-23 13:16:04,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:16:04,377 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:16:04,590 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:13,514 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:16:13,534 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:13,630 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:16:13,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13 WrapperNode [2018-11-23 13:16:13,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:13,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:13,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:16:13,633 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:16:13,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:13,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:16:13,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:16:13,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:16:13,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... [2018-11-23 13:16:13,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:16:13,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:16:13,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:16:13,705 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:16:13,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 13:16:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:16:13,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:16:13,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:16:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:16:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:16:13,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:16:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:16:13,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:16:13,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:16:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-23 13:16:14,307 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:16:14,307 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 13:16:14,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:14 BoogieIcfgContainer [2018-11-23 13:16:14,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:16:14,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:16:14,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:16:14,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:16:14,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:04" (1/3) ... [2018-11-23 13:16:14,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d52492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:14, skipping insertion in model container [2018-11-23 13:16:14,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:13" (2/3) ... [2018-11-23 13:16:14,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d52492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:14, skipping insertion in model container [2018-11-23 13:16:14,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:14" (3/3) ... [2018-11-23 13:16:14,317 INFO L112 eAbstractionObserver]: Analyzing ICFG heavy_false-unreach-call.c [2018-11-23 13:16:14,326 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:16:14,334 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:16:14,352 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:16:14,383 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:16:14,384 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:16:14,384 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:16:14,384 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:16:14,384 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:16:14,384 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:16:14,385 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:16:14,385 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:16:14,385 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:16:14,403 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:16:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:16:14,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:14,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:14,412 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:14,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash 242978043, now seen corresponding path program 1 times [2018-11-23 13:16:14,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:14,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:14,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:14,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:16:14,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {22#true} is VALID [2018-11-23 13:16:14,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:16:14,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #52#return; {22#true} is VALID [2018-11-23 13:16:14,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {22#true} is VALID [2018-11-23 13:16:14,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {22#true} is VALID [2018-11-23 13:16:14,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:16:14,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 != ~a~0 % 4294967296; {23#false} is VALID [2018-11-23 13:16:14,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:16:14,602 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 13:16:14,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:14,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:16:14,609 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-23 13:16:14,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:14,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:16:14,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:14,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:16:14,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:16:14,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:14,686 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:16:14,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:14,926 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2018-11-23 13:16:14,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:16:14,927 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-23 13:16:14,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-23 13:16:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 44 transitions. [2018-11-23 13:16:14,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 44 transitions. [2018-11-23 13:16:15,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:15,156 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:16:15,156 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:16:15,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 13:16:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:16:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:16:15,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:15,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:16:15,228 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:16:15,228 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:16:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:15,231 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:16:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:16:15,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:15,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:15,231 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:16:15,231 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:16:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:15,234 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:16:15,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:16:15,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:15,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:15,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:15,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:16:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 13:16:15,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2018-11-23 13:16:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:15,240 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 13:16:15,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:16:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:16:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:16:15,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:15,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:15,241 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:15,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash 242949213, now seen corresponding path program 1 times [2018-11-23 13:16:15,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:15,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:15,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:15,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:15,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:15,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {123#true} call ULTIMATE.init(); {123#true} is VALID [2018-11-23 13:16:15,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {123#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {123#true} is VALID [2018-11-23 13:16:15,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {123#true} assume true; {123#true} is VALID [2018-11-23 13:16:15,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} #52#return; {123#true} is VALID [2018-11-23 13:16:15,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {123#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {123#true} is VALID [2018-11-23 13:16:15,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {123#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {125#(= main_~i~0 0)} is VALID [2018-11-23 13:16:15,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {125#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 1048576); {124#false} is VALID [2018-11-23 13:16:15,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {124#false} assume 0 != ~a~0 % 4294967296; {124#false} is VALID [2018-11-23 13:16:15,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {124#false} assume !false; {124#false} is VALID [2018-11-23 13:16:15,364 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 13:16:15,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:15,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:16:15,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 13:16:15,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:15,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:16:15,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:15,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:16:15,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:16:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:15,395 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states. [2018-11-23 13:16:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:15,607 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 13:16:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:16:15,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 13:16:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-23 13:16:15,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-23 13:16:15,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2018-11-23 13:16:15,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:15,666 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:16:15,666 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:16:15,667 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 13:16:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:16:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-11-23 13:16:15,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:15,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 16 states. [2018-11-23 13:16:15,683 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 16 states. [2018-11-23 13:16:15,683 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 16 states. [2018-11-23 13:16:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:15,685 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:16:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 13:16:15,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:15,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:15,686 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 21 states. [2018-11-23 13:16:15,686 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 21 states. [2018-11-23 13:16:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:15,690 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:16:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-23 13:16:15,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:15,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:15,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:15,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:16:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 13:16:15,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2018-11-23 13:16:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:15,693 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 13:16:15,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:16:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:16:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:16:15,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:15,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:15,699 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:15,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 713101374, now seen corresponding path program 1 times [2018-11-23 13:16:15,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:15,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:15,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:15,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-23 13:16:15,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {231#true} is VALID [2018-11-23 13:16:15,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-23 13:16:15,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #52#return; {231#true} is VALID [2018-11-23 13:16:15,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {231#true} is VALID [2018-11-23 13:16:15,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {233#(= main_~i~0 0)} is VALID [2018-11-23 13:16:15,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {233#(= main_~i~0 0)} is VALID [2018-11-23 13:16:15,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {233#(= main_~i~0 0)} is VALID [2018-11-23 13:16:15,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {234#(and (<= main_~i~0 1) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:16:15,960 INFO L273 TraceCheckUtils]: 9: Hoare triple {234#(and (<= main_~i~0 1) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 1048576); {232#false} is VALID [2018-11-23 13:16:15,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {232#false} assume 0 != ~a~0 % 4294967296; {232#false} is VALID [2018-11-23 13:16:15,961 INFO L273 TraceCheckUtils]: 11: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-23 13:16:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:15,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:15,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 13:16:15,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:16,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:16,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-23 13:16:16,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {231#true} is VALID [2018-11-23 13:16:16,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-23 13:16:16,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #52#return; {231#true} is VALID [2018-11-23 13:16:16,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {231#true} is VALID [2018-11-23 13:16:16,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {233#(= main_~i~0 0)} is VALID [2018-11-23 13:16:16,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {256#(= main_~j~0 0)} is VALID [2018-11-23 13:16:16,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {256#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < 1048576); {232#false} is VALID [2018-11-23 13:16:16,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {232#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {232#false} is VALID [2018-11-23 13:16:16,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {232#false} assume !(~i~0 % 4294967296 < 1048576); {232#false} is VALID [2018-11-23 13:16:16,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {232#false} assume 0 != ~a~0 % 4294967296; {232#false} is VALID [2018-11-23 13:16:16,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-23 13:16:16,398 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 13:16:16,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:16,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-23 13:16:16,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:16:16,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:16,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:16:16,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:16,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:16:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:16:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:16,447 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-11-23 13:16:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:16,906 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2018-11-23 13:16:16,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:16:16,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:16:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 13:16:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-23 13:16:16,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-23 13:16:17,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:17,025 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:16:17,025 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:16:17,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:16:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-11-23 13:16:17,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:17,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 24 states. [2018-11-23 13:16:17,053 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 24 states. [2018-11-23 13:16:17,053 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 24 states. [2018-11-23 13:16:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:17,058 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-11-23 13:16:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 13:16:17,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:17,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:17,059 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 39 states. [2018-11-23 13:16:17,059 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 39 states. [2018-11-23 13:16:17,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:17,062 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-11-23 13:16:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 13:16:17,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:17,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:17,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:17,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:16:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 13:16:17,065 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 12 [2018-11-23 13:16:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:17,066 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 13:16:17,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:16:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 13:16:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:16:17,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:17,067 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:17,067 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:17,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1308348629, now seen corresponding path program 1 times [2018-11-23 13:16:17,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:17,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:17,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2018-11-23 13:16:17,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {463#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {463#true} is VALID [2018-11-23 13:16:17,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2018-11-23 13:16:17,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #52#return; {463#true} is VALID [2018-11-23 13:16:17,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {463#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {463#true} is VALID [2018-11-23 13:16:17,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {463#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {463#true} is VALID [2018-11-23 13:16:17,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {463#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {465#(= main_~j~0 0)} is VALID [2018-11-23 13:16:17,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {465#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {465#(= main_~j~0 0)} is VALID [2018-11-23 13:16:17,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {465#(= main_~j~0 0)} assume !(~k~0 % 4294967296 < 1048576); {465#(= main_~j~0 0)} is VALID [2018-11-23 13:16:17,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {465#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {466#(and (<= main_~j~0 1) (< 0 (+ (div main_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:16:17,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {466#(and (<= main_~j~0 1) (< 0 (+ (div main_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {464#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {464#false} is VALID [2018-11-23 13:16:17,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {464#false} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {464#false} is VALID [2018-11-23 13:16:17,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {464#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {464#false} is VALID [2018-11-23 13:16:17,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {464#false} assume !(~k~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {464#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {464#false} is VALID [2018-11-23 13:16:17,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {464#false} assume !(~j~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {464#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {464#false} is VALID [2018-11-23 13:16:17,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {464#false} assume !(~i~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {464#false} assume 0 != ~a~0 % 4294967296; {464#false} is VALID [2018-11-23 13:16:17,222 INFO L273 TraceCheckUtils]: 20: Hoare triple {464#false} assume !false; {464#false} is VALID [2018-11-23 13:16:17,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:16:17,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:17,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 13:16:17,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:17,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:17,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2018-11-23 13:16:17,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {463#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {463#true} is VALID [2018-11-23 13:16:17,394 INFO L273 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2018-11-23 13:16:17,394 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #52#return; {463#true} is VALID [2018-11-23 13:16:17,395 INFO L256 TraceCheckUtils]: 4: Hoare triple {463#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {463#true} is VALID [2018-11-23 13:16:17,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {463#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {485#(= main_~i~0 0)} is VALID [2018-11-23 13:16:17,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {485#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {463#true} is VALID [2018-11-23 13:16:17,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {463#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {492#(= main_~k~0 0)} is VALID [2018-11-23 13:16:17,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {492#(= main_~k~0 0)} assume !(~k~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {464#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {464#false} is VALID [2018-11-23 13:16:17,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {464#false} assume !(~j~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {464#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {464#false} is VALID [2018-11-23 13:16:17,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {464#false} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {464#false} is VALID [2018-11-23 13:16:17,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {464#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {464#false} is VALID [2018-11-23 13:16:17,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {464#false} assume !(~k~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {464#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {464#false} is VALID [2018-11-23 13:16:17,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {464#false} assume !(~j~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {464#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {464#false} is VALID [2018-11-23 13:16:17,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {464#false} assume !(~i~0 % 4294967296 < 1048576); {464#false} is VALID [2018-11-23 13:16:17,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {464#false} assume 0 != ~a~0 % 4294967296; {464#false} is VALID [2018-11-23 13:16:17,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {464#false} assume !false; {464#false} is VALID [2018-11-23 13:16:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:16:17,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:17,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-23 13:16:17,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:16:17,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:17,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:16:17,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:17,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:16:17,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:16:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:17,455 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2018-11-23 13:16:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:17,935 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2018-11-23 13:16:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:16:17,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 13:16:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-23 13:16:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2018-11-23 13:16:17,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 76 transitions. [2018-11-23 13:16:18,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:18,074 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:16:18,074 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 13:16:18,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:16:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 13:16:18,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2018-11-23 13:16:18,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:18,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 36 states. [2018-11-23 13:16:18,139 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 36 states. [2018-11-23 13:16:18,140 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 36 states. [2018-11-23 13:16:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:18,144 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 13:16:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 13:16:18,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:18,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:18,145 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 50 states. [2018-11-23 13:16:18,145 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 50 states. [2018-11-23 13:16:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:18,149 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 13:16:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2018-11-23 13:16:18,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:18,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:18,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:18,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:16:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 13:16:18,154 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2018-11-23 13:16:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:18,154 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 13:16:18,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:16:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 13:16:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:16:18,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:18,159 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:18,159 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:18,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1611011581, now seen corresponding path program 1 times [2018-11-23 13:16:18,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:18,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:18,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 13:16:18,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {804#true} is VALID [2018-11-23 13:16:18,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 13:16:18,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #52#return; {804#true} is VALID [2018-11-23 13:16:18,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {804#true} is VALID [2018-11-23 13:16:18,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {804#true} is VALID [2018-11-23 13:16:18,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {804#true} is VALID [2018-11-23 13:16:18,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {804#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {804#true} is VALID [2018-11-23 13:16:18,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {804#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {804#true} is VALID [2018-11-23 13:16:18,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {804#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {804#true} is VALID [2018-11-23 13:16:18,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {804#true} assume !(~k~0 % 4294967296 < 1048576); {804#true} is VALID [2018-11-23 13:16:18,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {804#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {804#true} is VALID [2018-11-23 13:16:18,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {804#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {806#(= main_~k~0 0)} is VALID [2018-11-23 13:16:18,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {806#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {806#(= main_~k~0 0)} is VALID [2018-11-23 13:16:18,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#(= main_~k~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {807#(and (< 0 (+ (div main_~k~0 4294967296) 1)) (<= main_~k~0 1))} is VALID [2018-11-23 13:16:18,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {807#(and (< 0 (+ (div main_~k~0 4294967296) 1)) (<= main_~k~0 1))} assume !(~k~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:18,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {805#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {805#false} is VALID [2018-11-23 13:16:18,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {805#false} assume !(~j~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:18,833 INFO L273 TraceCheckUtils]: 18: Hoare triple {805#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {805#false} is VALID [2018-11-23 13:16:18,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {805#false} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {805#false} is VALID [2018-11-23 13:16:18,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {805#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {805#false} is VALID [2018-11-23 13:16:18,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {805#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {805#false} is VALID [2018-11-23 13:16:18,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {805#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {805#false} is VALID [2018-11-23 13:16:18,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {805#false} assume !(~k~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:18,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {805#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {805#false} is VALID [2018-11-23 13:16:18,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {805#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {805#false} is VALID [2018-11-23 13:16:18,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {805#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {805#false} is VALID [2018-11-23 13:16:18,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {805#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {805#false} is VALID [2018-11-23 13:16:18,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {805#false} assume !(~k~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:18,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {805#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {805#false} is VALID [2018-11-23 13:16:18,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {805#false} assume !(~j~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:18,838 INFO L273 TraceCheckUtils]: 31: Hoare triple {805#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {805#false} is VALID [2018-11-23 13:16:18,838 INFO L273 TraceCheckUtils]: 32: Hoare triple {805#false} assume !(~i~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:18,838 INFO L273 TraceCheckUtils]: 33: Hoare triple {805#false} assume 0 != ~a~0 % 4294967296; {805#false} is VALID [2018-11-23 13:16:18,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 13:16:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 13:16:18,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:18,841 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:18,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:18,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:19,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 13:16:19,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {804#true} is VALID [2018-11-23 13:16:19,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 13:16:19,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #52#return; {804#true} is VALID [2018-11-23 13:16:19,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {804#true} is VALID [2018-11-23 13:16:19,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {804#true} is VALID [2018-11-23 13:16:19,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {829#(= main_~j~0 0)} is VALID [2018-11-23 13:16:19,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {829#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {833#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2018-11-23 13:16:19,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {833#(and (= main_~k~0 0) (= main_~j~0 0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {833#(and (= main_~k~0 0) (= main_~j~0 0))} is VALID [2018-11-23 13:16:19,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {833#(and (= main_~k~0 0) (= main_~j~0 0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {840#(and (= main_~k~0 1) (= main_~j~0 0))} is VALID [2018-11-23 13:16:19,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {840#(and (= main_~k~0 1) (= main_~j~0 0))} assume !(~k~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:19,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {805#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {805#false} is VALID [2018-11-23 13:16:19,189 INFO L273 TraceCheckUtils]: 12: Hoare triple {805#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {805#false} is VALID [2018-11-23 13:16:19,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {805#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {805#false} is VALID [2018-11-23 13:16:19,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {805#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {805#false} is VALID [2018-11-23 13:16:19,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {805#false} assume !(~k~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:19,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {805#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {805#false} is VALID [2018-11-23 13:16:19,190 INFO L273 TraceCheckUtils]: 17: Hoare triple {805#false} assume !(~j~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:19,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {805#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {805#false} is VALID [2018-11-23 13:16:19,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {805#false} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {805#false} is VALID [2018-11-23 13:16:19,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {805#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {805#false} is VALID [2018-11-23 13:16:19,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {805#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {805#false} is VALID [2018-11-23 13:16:19,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {805#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {805#false} is VALID [2018-11-23 13:16:19,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {805#false} assume !(~k~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:19,191 INFO L273 TraceCheckUtils]: 24: Hoare triple {805#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {805#false} is VALID [2018-11-23 13:16:19,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {805#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {805#false} is VALID [2018-11-23 13:16:19,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {805#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {805#false} is VALID [2018-11-23 13:16:19,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {805#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {805#false} is VALID [2018-11-23 13:16:19,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {805#false} assume !(~k~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:19,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {805#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {805#false} is VALID [2018-11-23 13:16:19,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {805#false} assume !(~j~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:19,193 INFO L273 TraceCheckUtils]: 31: Hoare triple {805#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {805#false} is VALID [2018-11-23 13:16:19,193 INFO L273 TraceCheckUtils]: 32: Hoare triple {805#false} assume !(~i~0 % 4294967296 < 1048576); {805#false} is VALID [2018-11-23 13:16:19,193 INFO L273 TraceCheckUtils]: 33: Hoare triple {805#false} assume 0 != ~a~0 % 4294967296; {805#false} is VALID [2018-11-23 13:16:19,194 INFO L273 TraceCheckUtils]: 34: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 13:16:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 13:16:19,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:19,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-11-23 13:16:19,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 13:16:19,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:19,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:16:19,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:19,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:16:19,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:16:19,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:19,330 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 7 states. [2018-11-23 13:16:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:19,775 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-11-23 13:16:19,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:16:19,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-23 13:16:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-23 13:16:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:19,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-23 13:16:19,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2018-11-23 13:16:19,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:19,866 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:16:19,867 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:16:19,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:16:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 13:16:19,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:19,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 44 states. [2018-11-23 13:16:19,942 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 44 states. [2018-11-23 13:16:19,942 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 44 states. [2018-11-23 13:16:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:19,945 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 13:16:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 13:16:19,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:19,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:19,946 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 48 states. [2018-11-23 13:16:19,946 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 48 states. [2018-11-23 13:16:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:19,949 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 13:16:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-23 13:16:19,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:19,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:19,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:19,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:16:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-23 13:16:19,953 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 35 [2018-11-23 13:16:19,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:19,954 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-23 13:16:19,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:16:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 13:16:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:16:19,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:19,956 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:19,956 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 351043197, now seen corresponding path program 2 times [2018-11-23 13:16:19,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:19,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:21,314 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-23 13:16:21,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-23 13:16:21,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1194#true} is VALID [2018-11-23 13:16:21,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 13:16:21,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #52#return; {1194#true} is VALID [2018-11-23 13:16:21,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1194#true} is VALID [2018-11-23 13:16:21,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {1196#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {1196#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {1196#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {1196#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {1196#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {1196#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {1196#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {1196#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {1196#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {1196#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {1196#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {1196#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {1196#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {1196#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {1196#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {1196#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:21,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {1196#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,342 INFO L273 TraceCheckUtils]: 27: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,345 INFO L273 TraceCheckUtils]: 31: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,347 INFO L273 TraceCheckUtils]: 32: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,351 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,352 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~j~0 % 4294967296 < 1048576); {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:21,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1198#(and (<= main_~i~0 2) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:16:21,358 INFO L273 TraceCheckUtils]: 40: Hoare triple {1198#(and (<= main_~i~0 2) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 1048576); {1195#false} is VALID [2018-11-23 13:16:21,358 INFO L273 TraceCheckUtils]: 41: Hoare triple {1195#false} assume 0 != ~a~0 % 4294967296; {1195#false} is VALID [2018-11-23 13:16:21,358 INFO L273 TraceCheckUtils]: 42: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-23 13:16:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 13:16:21,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:21,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:21,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:21,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:21,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:21,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:22,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2018-11-23 13:16:22,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {1194#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1194#true} is VALID [2018-11-23 13:16:22,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2018-11-23 13:16:22,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #52#return; {1194#true} is VALID [2018-11-23 13:16:22,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1194#true} is VALID [2018-11-23 13:16:22,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {1194#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {1196#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,113 INFO L273 TraceCheckUtils]: 7: Hoare triple {1196#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {1196#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {1196#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {1196#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {1196#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {1196#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {1196#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {1196#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {1196#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {1196#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {1196#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {1196#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,120 INFO L273 TraceCheckUtils]: 19: Hoare triple {1196#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {1196#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {1196#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {1196#(= main_~i~0 0)} is VALID [2018-11-23 13:16:22,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {1196#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,145 INFO L273 TraceCheckUtils]: 24: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,148 INFO L273 TraceCheckUtils]: 25: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,149 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,149 INFO L273 TraceCheckUtils]: 27: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,150 INFO L273 TraceCheckUtils]: 28: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,153 INFO L273 TraceCheckUtils]: 30: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,154 INFO L273 TraceCheckUtils]: 31: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,165 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,166 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,166 INFO L273 TraceCheckUtils]: 38: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~j~0 % 4294967296 < 1048576); {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:22,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {1197#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1319#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:22,168 INFO L273 TraceCheckUtils]: 40: Hoare triple {1319#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~i~0 % 4294967296 < 1048576); {1195#false} is VALID [2018-11-23 13:16:22,169 INFO L273 TraceCheckUtils]: 41: Hoare triple {1195#false} assume 0 != ~a~0 % 4294967296; {1195#false} is VALID [2018-11-23 13:16:22,169 INFO L273 TraceCheckUtils]: 42: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2018-11-23 13:16:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 13:16:22,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:22,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:16:22,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-23 13:16:22,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:22,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:16:22,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:22,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:16:22,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:16:22,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:22,331 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 6 states. [2018-11-23 13:16:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:22,846 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-23 13:16:22,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:16:22,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-11-23 13:16:22,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2018-11-23 13:16:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2018-11-23 13:16:22,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2018-11-23 13:16:22,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:22,905 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:16:22,906 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 13:16:22,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 13:16:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2018-11-23 13:16:22,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:22,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 61 states. [2018-11-23 13:16:22,994 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 61 states. [2018-11-23 13:16:22,994 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 61 states. [2018-11-23 13:16:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:22,997 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-11-23 13:16:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2018-11-23 13:16:22,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:22,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:22,999 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 77 states. [2018-11-23 13:16:22,999 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 77 states. [2018-11-23 13:16:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:23,002 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-11-23 13:16:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2018-11-23 13:16:23,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:23,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:23,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:23,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:16:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-11-23 13:16:23,006 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 43 [2018-11-23 13:16:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:23,006 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-23 13:16:23,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:16:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 13:16:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 13:16:23,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:23,008 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:23,008 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:23,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2129823170, now seen corresponding path program 3 times [2018-11-23 13:16:23,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:23,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:24,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2018-11-23 13:16:24,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {1705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1705#true} is VALID [2018-11-23 13:16:24,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {1705#true} assume true; {1705#true} is VALID [2018-11-23 13:16:24,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1705#true} {1705#true} #52#return; {1705#true} is VALID [2018-11-23 13:16:24,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {1705#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1705#true} is VALID [2018-11-23 13:16:24,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {1705#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,009 INFO L273 TraceCheckUtils]: 6: Hoare triple {1707#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {1707#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {1707#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {1707#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {1707#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {1707#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {1707#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {1707#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {1707#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {1707#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {1707#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {1707#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {1707#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {1707#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {1707#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {1707#(= main_~i~0 0)} is VALID [2018-11-23 13:16:25,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {1707#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,052 INFO L273 TraceCheckUtils]: 24: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,053 INFO L273 TraceCheckUtils]: 25: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,056 INFO L273 TraceCheckUtils]: 28: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,056 INFO L273 TraceCheckUtils]: 29: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,057 INFO L273 TraceCheckUtils]: 30: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,058 INFO L273 TraceCheckUtils]: 31: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,059 INFO L273 TraceCheckUtils]: 32: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,062 INFO L273 TraceCheckUtils]: 35: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,066 INFO L273 TraceCheckUtils]: 37: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,067 INFO L273 TraceCheckUtils]: 38: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~j~0 % 4294967296 < 1048576); {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:25,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {1708#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,068 INFO L273 TraceCheckUtils]: 41: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,069 INFO L273 TraceCheckUtils]: 43: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,071 INFO L273 TraceCheckUtils]: 46: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~k~0 % 4294967296 < 1048576); {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,073 INFO L273 TraceCheckUtils]: 48: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,075 INFO L273 TraceCheckUtils]: 49: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,076 INFO L273 TraceCheckUtils]: 50: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,077 INFO L273 TraceCheckUtils]: 51: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,077 INFO L273 TraceCheckUtils]: 52: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~k~0 % 4294967296 < 1048576); {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,078 INFO L273 TraceCheckUtils]: 54: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,078 INFO L273 TraceCheckUtils]: 55: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~j~0 % 4294967296 < 1048576); {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:25,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {1709#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1710#(and (<= main_~i~0 3) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:16:25,080 INFO L273 TraceCheckUtils]: 57: Hoare triple {1710#(and (<= main_~i~0 3) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 1048576); {1706#false} is VALID [2018-11-23 13:16:25,080 INFO L273 TraceCheckUtils]: 58: Hoare triple {1706#false} assume 0 != ~a~0 % 4294967296; {1706#false} is VALID [2018-11-23 13:16:25,081 INFO L273 TraceCheckUtils]: 59: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2018-11-23 13:16:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 13:16:25,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:25,087 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:25,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:25,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 13:16:25,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:25,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:25,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2018-11-23 13:16:25,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {1705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {1705#true} is VALID [2018-11-23 13:16:25,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {1705#true} assume true; {1705#true} is VALID [2018-11-23 13:16:25,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1705#true} {1705#true} #52#return; {1705#true} is VALID [2018-11-23 13:16:25,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {1705#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {1705#true} is VALID [2018-11-23 13:16:25,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {1705#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {1729#(and (= main_~a~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:16:25,848 INFO L273 TraceCheckUtils]: 6: Hoare triple {1729#(and (= main_~a~0 1) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1733#(and (= main_~a~0 1) (= main_~j~0 0))} is VALID [2018-11-23 13:16:25,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {1733#(and (= main_~a~0 1) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1737#(and (= main_~a~0 1) (= main_~k~0 0))} is VALID [2018-11-23 13:16:25,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {1737#(and (= main_~a~0 1) (= main_~k~0 0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1737#(and (= main_~a~0 1) (= main_~k~0 0))} is VALID [2018-11-23 13:16:25,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {1737#(and (= main_~a~0 1) (= main_~k~0 0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1744#(and (= main_~k~0 1) (= main_~a~0 1))} is VALID [2018-11-23 13:16:25,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {1744#(and (= main_~k~0 1) (= main_~a~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {1748#(= main_~a~0 1)} assume !(~k~0 % 4294967296 < 1048576); {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {1748#(= main_~a~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {1748#(= main_~a~0 1)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {1748#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,854 INFO L273 TraceCheckUtils]: 16: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {1748#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,856 INFO L273 TraceCheckUtils]: 19: Hoare triple {1748#(= main_~a~0 1)} assume !(~k~0 % 4294967296 < 1048576); {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,856 INFO L273 TraceCheckUtils]: 20: Hoare triple {1748#(= main_~a~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {1748#(= main_~a~0 1)} assume !(~j~0 % 4294967296 < 1048576); {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {1748#(= main_~a~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,858 INFO L273 TraceCheckUtils]: 23: Hoare triple {1748#(= main_~a~0 1)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,858 INFO L273 TraceCheckUtils]: 24: Hoare triple {1748#(= main_~a~0 1)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,859 INFO L273 TraceCheckUtils]: 25: Hoare triple {1748#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,860 INFO L273 TraceCheckUtils]: 26: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,860 INFO L273 TraceCheckUtils]: 27: Hoare triple {1748#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,861 INFO L273 TraceCheckUtils]: 28: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,861 INFO L273 TraceCheckUtils]: 29: Hoare triple {1748#(= main_~a~0 1)} assume !(~k~0 % 4294967296 < 1048576); {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,862 INFO L273 TraceCheckUtils]: 30: Hoare triple {1748#(= main_~a~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,863 INFO L273 TraceCheckUtils]: 31: Hoare triple {1748#(= main_~a~0 1)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,871 INFO L273 TraceCheckUtils]: 32: Hoare triple {1748#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,871 INFO L273 TraceCheckUtils]: 33: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {1748#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,872 INFO L273 TraceCheckUtils]: 35: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,872 INFO L273 TraceCheckUtils]: 36: Hoare triple {1748#(= main_~a~0 1)} assume !(~k~0 % 4294967296 < 1048576); {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,872 INFO L273 TraceCheckUtils]: 37: Hoare triple {1748#(= main_~a~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,873 INFO L273 TraceCheckUtils]: 38: Hoare triple {1748#(= main_~a~0 1)} assume !(~j~0 % 4294967296 < 1048576); {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {1748#(= main_~a~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,874 INFO L273 TraceCheckUtils]: 40: Hoare triple {1748#(= main_~a~0 1)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,874 INFO L273 TraceCheckUtils]: 41: Hoare triple {1748#(= main_~a~0 1)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,874 INFO L273 TraceCheckUtils]: 42: Hoare triple {1748#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,875 INFO L273 TraceCheckUtils]: 43: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,875 INFO L273 TraceCheckUtils]: 44: Hoare triple {1748#(= main_~a~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,878 INFO L273 TraceCheckUtils]: 45: Hoare triple {1748#(= main_~a~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {1748#(= main_~a~0 1)} assume !(~k~0 % 4294967296 < 1048576); {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {1748#(= main_~a~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1748#(= main_~a~0 1)} is VALID [2018-11-23 13:16:25,880 INFO L273 TraceCheckUtils]: 48: Hoare triple {1748#(= main_~a~0 1)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {1737#(and (= main_~a~0 1) (= main_~k~0 0))} is VALID [2018-11-23 13:16:25,880 INFO L273 TraceCheckUtils]: 49: Hoare triple {1737#(and (= main_~a~0 1) (= main_~k~0 0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1737#(and (= main_~a~0 1) (= main_~k~0 0))} is VALID [2018-11-23 13:16:25,888 INFO L273 TraceCheckUtils]: 50: Hoare triple {1737#(and (= main_~a~0 1) (= main_~k~0 0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1744#(and (= main_~k~0 1) (= main_~a~0 1))} is VALID [2018-11-23 13:16:25,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {1744#(and (= main_~k~0 1) (= main_~a~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {1744#(and (= main_~k~0 1) (= main_~a~0 1))} is VALID [2018-11-23 13:16:25,889 INFO L273 TraceCheckUtils]: 52: Hoare triple {1744#(and (= main_~k~0 1) (= main_~a~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {1875#(and (= main_~a~0 1) (= main_~k~0 2))} is VALID [2018-11-23 13:16:25,889 INFO L273 TraceCheckUtils]: 53: Hoare triple {1875#(and (= main_~a~0 1) (= main_~k~0 2))} assume !(~k~0 % 4294967296 < 1048576); {1706#false} is VALID [2018-11-23 13:16:25,890 INFO L273 TraceCheckUtils]: 54: Hoare triple {1706#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1706#false} is VALID [2018-11-23 13:16:25,890 INFO L273 TraceCheckUtils]: 55: Hoare triple {1706#false} assume !(~j~0 % 4294967296 < 1048576); {1706#false} is VALID [2018-11-23 13:16:25,890 INFO L273 TraceCheckUtils]: 56: Hoare triple {1706#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1706#false} is VALID [2018-11-23 13:16:25,890 INFO L273 TraceCheckUtils]: 57: Hoare triple {1706#false} assume !(~i~0 % 4294967296 < 1048576); {1706#false} is VALID [2018-11-23 13:16:25,890 INFO L273 TraceCheckUtils]: 58: Hoare triple {1706#false} assume 0 != ~a~0 % 4294967296; {1706#false} is VALID [2018-11-23 13:16:25,890 INFO L273 TraceCheckUtils]: 59: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2018-11-23 13:16:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 75 proven. 54 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-23 13:16:25,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:25,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-11-23 13:16:25,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-11-23 13:16:25,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:25,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:16:26,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:26,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:16:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:16:26,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:16:26,021 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 12 states. [2018-11-23 13:16:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:29,067 INFO L93 Difference]: Finished difference Result 172 states and 206 transitions. [2018-11-23 13:16:29,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 13:16:29,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-11-23 13:16:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:16:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 156 transitions. [2018-11-23 13:16:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:16:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 156 transitions. [2018-11-23 13:16:29,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 156 transitions. [2018-11-23 13:16:29,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:29,309 INFO L225 Difference]: With dead ends: 172 [2018-11-23 13:16:29,309 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 13:16:29,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=360, Invalid=1710, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 13:16:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 13:16:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2018-11-23 13:16:29,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:29,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 94 states. [2018-11-23 13:16:29,465 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 94 states. [2018-11-23 13:16:29,465 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 94 states. [2018-11-23 13:16:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:29,470 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-11-23 13:16:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2018-11-23 13:16:29,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:29,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:29,471 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 124 states. [2018-11-23 13:16:29,471 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 124 states. [2018-11-23 13:16:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:29,476 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-11-23 13:16:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2018-11-23 13:16:29,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:29,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:29,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:29,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 13:16:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-11-23 13:16:29,480 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 60 [2018-11-23 13:16:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:29,480 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-11-23 13:16:29,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:16:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-11-23 13:16:29,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 13:16:29,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:29,482 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:29,482 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:29,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:29,482 INFO L82 PathProgramCache]: Analyzing trace with hash -499734115, now seen corresponding path program 4 times [2018-11-23 13:16:29,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:29,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:29,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:29,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:40,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {2624#true} call ULTIMATE.init(); {2624#true} is VALID [2018-11-23 13:16:40,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {2624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2624#true} is VALID [2018-11-23 13:16:40,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {2624#true} assume true; {2624#true} is VALID [2018-11-23 13:16:40,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2624#true} {2624#true} #52#return; {2624#true} is VALID [2018-11-23 13:16:40,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {2624#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {2624#true} is VALID [2018-11-23 13:16:40,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {2624#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {2626#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {2626#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {2626#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {2626#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {2626#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,429 INFO L273 TraceCheckUtils]: 18: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,429 INFO L273 TraceCheckUtils]: 19: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,430 INFO L273 TraceCheckUtils]: 20: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,442 INFO L273 TraceCheckUtils]: 22: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {2626#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {2626#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {2626#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {2626#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,448 INFO L273 TraceCheckUtils]: 30: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,458 INFO L273 TraceCheckUtils]: 44: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,459 INFO L273 TraceCheckUtils]: 45: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,460 INFO L273 TraceCheckUtils]: 46: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~j~0 % 4294967296 < 1048576); {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,461 INFO L273 TraceCheckUtils]: 47: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,461 INFO L273 TraceCheckUtils]: 48: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,462 INFO L273 TraceCheckUtils]: 49: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,463 INFO L273 TraceCheckUtils]: 50: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,464 INFO L273 TraceCheckUtils]: 51: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,467 INFO L273 TraceCheckUtils]: 54: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,467 INFO L273 TraceCheckUtils]: 55: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,468 INFO L273 TraceCheckUtils]: 56: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~k~0 % 4294967296 < 1048576); {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,469 INFO L273 TraceCheckUtils]: 57: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,470 INFO L273 TraceCheckUtils]: 58: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,471 INFO L273 TraceCheckUtils]: 59: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,471 INFO L273 TraceCheckUtils]: 60: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,472 INFO L273 TraceCheckUtils]: 61: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,473 INFO L273 TraceCheckUtils]: 62: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,474 INFO L273 TraceCheckUtils]: 63: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,475 INFO L273 TraceCheckUtils]: 64: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,476 INFO L273 TraceCheckUtils]: 65: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~k~0 % 4294967296 < 1048576); {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,476 INFO L273 TraceCheckUtils]: 66: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,477 INFO L273 TraceCheckUtils]: 67: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~j~0 % 4294967296 < 1048576); {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,496 INFO L273 TraceCheckUtils]: 68: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,505 INFO L273 TraceCheckUtils]: 69: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,519 INFO L273 TraceCheckUtils]: 70: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,528 INFO L273 TraceCheckUtils]: 71: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,541 INFO L273 TraceCheckUtils]: 72: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,542 INFO L273 TraceCheckUtils]: 73: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,543 INFO L273 TraceCheckUtils]: 74: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,543 INFO L273 TraceCheckUtils]: 75: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,544 INFO L273 TraceCheckUtils]: 76: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,544 INFO L273 TraceCheckUtils]: 77: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !(~k~0 % 4294967296 < 1048576); {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,545 INFO L273 TraceCheckUtils]: 78: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,546 INFO L273 TraceCheckUtils]: 79: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,547 INFO L273 TraceCheckUtils]: 80: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,547 INFO L273 TraceCheckUtils]: 81: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,549 INFO L273 TraceCheckUtils]: 82: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,549 INFO L273 TraceCheckUtils]: 83: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,550 INFO L273 TraceCheckUtils]: 84: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,551 INFO L273 TraceCheckUtils]: 85: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,552 INFO L273 TraceCheckUtils]: 86: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !(~k~0 % 4294967296 < 1048576); {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,552 INFO L273 TraceCheckUtils]: 87: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,553 INFO L273 TraceCheckUtils]: 88: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !(~j~0 % 4294967296 < 1048576); {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:40,554 INFO L273 TraceCheckUtils]: 89: Hoare triple {2629#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2630#(and (<= main_~i~0 4) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:16:40,555 INFO L273 TraceCheckUtils]: 90: Hoare triple {2630#(and (<= main_~i~0 4) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 1048576); {2625#false} is VALID [2018-11-23 13:16:40,555 INFO L273 TraceCheckUtils]: 91: Hoare triple {2625#false} assume 0 != ~a~0 % 4294967296; {2625#false} is VALID [2018-11-23 13:16:40,556 INFO L273 TraceCheckUtils]: 92: Hoare triple {2625#false} assume !false; {2625#false} is VALID [2018-11-23 13:16:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 694 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-23 13:16:40,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:40,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:40,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:16:40,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:16:40,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:40,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:40,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {2624#true} call ULTIMATE.init(); {2624#true} is VALID [2018-11-23 13:16:40,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {2624#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {2624#true} is VALID [2018-11-23 13:16:40,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {2624#true} assume true; {2624#true} is VALID [2018-11-23 13:16:40,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2624#true} {2624#true} #52#return; {2624#true} is VALID [2018-11-23 13:16:40,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {2624#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {2624#true} is VALID [2018-11-23 13:16:40,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {2624#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {2626#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {2626#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {2626#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {2626#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,880 INFO L273 TraceCheckUtils]: 16: Hoare triple {2626#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,881 INFO L273 TraceCheckUtils]: 19: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,882 INFO L273 TraceCheckUtils]: 21: Hoare triple {2626#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {2626#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,883 INFO L273 TraceCheckUtils]: 23: Hoare triple {2626#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,884 INFO L273 TraceCheckUtils]: 24: Hoare triple {2626#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,885 INFO L273 TraceCheckUtils]: 25: Hoare triple {2626#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {2626#(= main_~i~0 0)} is VALID [2018-11-23 13:16:40,885 INFO L273 TraceCheckUtils]: 26: Hoare triple {2626#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,886 INFO L273 TraceCheckUtils]: 27: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,887 INFO L273 TraceCheckUtils]: 28: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,888 INFO L273 TraceCheckUtils]: 29: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,890 INFO L273 TraceCheckUtils]: 31: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,891 INFO L273 TraceCheckUtils]: 32: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,892 INFO L273 TraceCheckUtils]: 33: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,892 INFO L273 TraceCheckUtils]: 34: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,893 INFO L273 TraceCheckUtils]: 35: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,894 INFO L273 TraceCheckUtils]: 37: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,896 INFO L273 TraceCheckUtils]: 38: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,896 INFO L273 TraceCheckUtils]: 39: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,897 INFO L273 TraceCheckUtils]: 40: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,899 INFO L273 TraceCheckUtils]: 42: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,900 INFO L273 TraceCheckUtils]: 43: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,901 INFO L273 TraceCheckUtils]: 44: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,901 INFO L273 TraceCheckUtils]: 45: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,902 INFO L273 TraceCheckUtils]: 46: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~j~0 % 4294967296 < 1048576); {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:40,903 INFO L273 TraceCheckUtils]: 47: Hoare triple {2627#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,904 INFO L273 TraceCheckUtils]: 48: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,904 INFO L273 TraceCheckUtils]: 49: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,905 INFO L273 TraceCheckUtils]: 50: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,906 INFO L273 TraceCheckUtils]: 51: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,907 INFO L273 TraceCheckUtils]: 52: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,908 INFO L273 TraceCheckUtils]: 53: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,910 INFO L273 TraceCheckUtils]: 55: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~k~0 % 4294967296 < 1048576); {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,911 INFO L273 TraceCheckUtils]: 57: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,912 INFO L273 TraceCheckUtils]: 58: Hoare triple {2628#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2808#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 0))} is VALID [2018-11-23 13:16:40,913 INFO L273 TraceCheckUtils]: 59: Hoare triple {2808#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2808#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 0))} is VALID [2018-11-23 13:16:40,914 INFO L273 TraceCheckUtils]: 60: Hoare triple {2808#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2815#(and (<= 2 main_~i~0) (= main_~k~0 1) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,915 INFO L273 TraceCheckUtils]: 61: Hoare triple {2815#(and (<= 2 main_~i~0) (= main_~k~0 1) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2815#(and (<= 2 main_~i~0) (= main_~k~0 1) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:40,921 INFO L273 TraceCheckUtils]: 62: Hoare triple {2815#(and (<= 2 main_~i~0) (= main_~k~0 1) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2822#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 2))} is VALID [2018-11-23 13:16:40,922 INFO L273 TraceCheckUtils]: 63: Hoare triple {2822#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2822#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 2))} is VALID [2018-11-23 13:16:40,922 INFO L273 TraceCheckUtils]: 64: Hoare triple {2822#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2829#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 3))} is VALID [2018-11-23 13:16:40,923 INFO L273 TraceCheckUtils]: 65: Hoare triple {2829#(and (<= 2 main_~i~0) (<= main_~i~0 2) (= main_~k~0 3))} assume !(~k~0 % 4294967296 < 1048576); {2625#false} is VALID [2018-11-23 13:16:40,923 INFO L273 TraceCheckUtils]: 66: Hoare triple {2625#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2625#false} is VALID [2018-11-23 13:16:40,923 INFO L273 TraceCheckUtils]: 67: Hoare triple {2625#false} assume !(~j~0 % 4294967296 < 1048576); {2625#false} is VALID [2018-11-23 13:16:40,923 INFO L273 TraceCheckUtils]: 68: Hoare triple {2625#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2625#false} is VALID [2018-11-23 13:16:40,923 INFO L273 TraceCheckUtils]: 69: Hoare triple {2625#false} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {2625#false} is VALID [2018-11-23 13:16:40,923 INFO L273 TraceCheckUtils]: 70: Hoare triple {2625#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2625#false} is VALID [2018-11-23 13:16:40,923 INFO L273 TraceCheckUtils]: 71: Hoare triple {2625#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2625#false} is VALID [2018-11-23 13:16:40,924 INFO L273 TraceCheckUtils]: 72: Hoare triple {2625#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2625#false} is VALID [2018-11-23 13:16:40,924 INFO L273 TraceCheckUtils]: 73: Hoare triple {2625#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2625#false} is VALID [2018-11-23 13:16:40,924 INFO L273 TraceCheckUtils]: 74: Hoare triple {2625#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2625#false} is VALID [2018-11-23 13:16:40,924 INFO L273 TraceCheckUtils]: 75: Hoare triple {2625#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2625#false} is VALID [2018-11-23 13:16:40,924 INFO L273 TraceCheckUtils]: 76: Hoare triple {2625#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2625#false} is VALID [2018-11-23 13:16:40,924 INFO L273 TraceCheckUtils]: 77: Hoare triple {2625#false} assume !(~k~0 % 4294967296 < 1048576); {2625#false} is VALID [2018-11-23 13:16:40,925 INFO L273 TraceCheckUtils]: 78: Hoare triple {2625#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2625#false} is VALID [2018-11-23 13:16:40,925 INFO L273 TraceCheckUtils]: 79: Hoare triple {2625#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {2625#false} is VALID [2018-11-23 13:16:40,925 INFO L273 TraceCheckUtils]: 80: Hoare triple {2625#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2625#false} is VALID [2018-11-23 13:16:40,925 INFO L273 TraceCheckUtils]: 81: Hoare triple {2625#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2625#false} is VALID [2018-11-23 13:16:40,925 INFO L273 TraceCheckUtils]: 82: Hoare triple {2625#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2625#false} is VALID [2018-11-23 13:16:40,926 INFO L273 TraceCheckUtils]: 83: Hoare triple {2625#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2625#false} is VALID [2018-11-23 13:16:40,926 INFO L273 TraceCheckUtils]: 84: Hoare triple {2625#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {2625#false} is VALID [2018-11-23 13:16:40,926 INFO L273 TraceCheckUtils]: 85: Hoare triple {2625#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {2625#false} is VALID [2018-11-23 13:16:40,926 INFO L273 TraceCheckUtils]: 86: Hoare triple {2625#false} assume !(~k~0 % 4294967296 < 1048576); {2625#false} is VALID [2018-11-23 13:16:40,927 INFO L273 TraceCheckUtils]: 87: Hoare triple {2625#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2625#false} is VALID [2018-11-23 13:16:40,927 INFO L273 TraceCheckUtils]: 88: Hoare triple {2625#false} assume !(~j~0 % 4294967296 < 1048576); {2625#false} is VALID [2018-11-23 13:16:40,927 INFO L273 TraceCheckUtils]: 89: Hoare triple {2625#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2625#false} is VALID [2018-11-23 13:16:40,927 INFO L273 TraceCheckUtils]: 90: Hoare triple {2625#false} assume !(~i~0 % 4294967296 < 1048576); {2625#false} is VALID [2018-11-23 13:16:40,927 INFO L273 TraceCheckUtils]: 91: Hoare triple {2625#false} assume 0 != ~a~0 % 4294967296; {2625#false} is VALID [2018-11-23 13:16:40,927 INFO L273 TraceCheckUtils]: 92: Hoare triple {2625#false} assume !false; {2625#false} is VALID [2018-11-23 13:16:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 382 proven. 342 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-23 13:16:40,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:40,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2018-11-23 13:16:40,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-11-23 13:16:40,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:40,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:16:41,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:41,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:16:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:16:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:16:41,019 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 11 states. [2018-11-23 13:16:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:41,940 INFO L93 Difference]: Finished difference Result 178 states and 204 transitions. [2018-11-23 13:16:41,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:16:41,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-11-23 13:16:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:16:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2018-11-23 13:16:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:16:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2018-11-23 13:16:41,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 78 transitions. [2018-11-23 13:16:42,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:42,351 INFO L225 Difference]: With dead ends: 178 [2018-11-23 13:16:42,351 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 13:16:42,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:16:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 13:16:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2018-11-23 13:16:42,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:42,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 119 states. [2018-11-23 13:16:42,729 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 119 states. [2018-11-23 13:16:42,729 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 119 states. [2018-11-23 13:16:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:42,734 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2018-11-23 13:16:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2018-11-23 13:16:42,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:42,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:42,735 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 141 states. [2018-11-23 13:16:42,735 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 141 states. [2018-11-23 13:16:42,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:42,739 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2018-11-23 13:16:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2018-11-23 13:16:42,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:42,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:42,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:42,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 13:16:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2018-11-23 13:16:42,744 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 93 [2018-11-23 13:16:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:42,744 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2018-11-23 13:16:42,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:16:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2018-11-23 13:16:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 13:16:42,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:42,746 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:42,746 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:42,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1171752674, now seen corresponding path program 5 times [2018-11-23 13:16:42,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:42,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:45,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {3659#true} call ULTIMATE.init(); {3659#true} is VALID [2018-11-23 13:16:45,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {3659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3659#true} is VALID [2018-11-23 13:16:45,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {3659#true} assume true; {3659#true} is VALID [2018-11-23 13:16:45,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3659#true} {3659#true} #52#return; {3659#true} is VALID [2018-11-23 13:16:45,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {3659#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {3659#true} is VALID [2018-11-23 13:16:45,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {3659#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {3661#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {3661#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {3661#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {3661#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {3661#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {3661#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {3661#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {3661#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {3661#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {3661#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {3661#(= main_~i~0 0)} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {3661#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {3661#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {3661#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {3661#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {3661#(= main_~i~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {3661#(= main_~i~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,332 INFO L273 TraceCheckUtils]: 23: Hoare triple {3661#(= main_~i~0 0)} assume !(~k~0 % 4294967296 < 1048576); {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {3661#(= main_~i~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {3661#(= main_~i~0 0)} assume !(~j~0 % 4294967296 < 1048576); {3661#(= main_~i~0 0)} is VALID [2018-11-23 13:16:45,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {3661#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,334 INFO L273 TraceCheckUtils]: 27: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,335 INFO L273 TraceCheckUtils]: 28: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,337 INFO L273 TraceCheckUtils]: 30: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,340 INFO L273 TraceCheckUtils]: 33: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,341 INFO L273 TraceCheckUtils]: 34: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,341 INFO L273 TraceCheckUtils]: 35: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,342 INFO L273 TraceCheckUtils]: 36: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,344 INFO L273 TraceCheckUtils]: 38: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,345 INFO L273 TraceCheckUtils]: 40: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,347 INFO L273 TraceCheckUtils]: 42: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,349 INFO L273 TraceCheckUtils]: 44: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~k~0 % 4294967296 < 1048576); {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,349 INFO L273 TraceCheckUtils]: 45: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,350 INFO L273 TraceCheckUtils]: 46: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !(~j~0 % 4294967296 < 1048576); {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:16:45,351 INFO L273 TraceCheckUtils]: 47: Hoare triple {3662#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,352 INFO L273 TraceCheckUtils]: 48: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,352 INFO L273 TraceCheckUtils]: 49: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,353 INFO L273 TraceCheckUtils]: 50: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,354 INFO L273 TraceCheckUtils]: 51: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,355 INFO L273 TraceCheckUtils]: 52: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,356 INFO L273 TraceCheckUtils]: 53: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,358 INFO L273 TraceCheckUtils]: 55: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,359 INFO L273 TraceCheckUtils]: 56: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,360 INFO L273 TraceCheckUtils]: 57: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~k~0 % 4294967296 < 1048576); {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,362 INFO L273 TraceCheckUtils]: 60: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,363 INFO L273 TraceCheckUtils]: 61: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,363 INFO L273 TraceCheckUtils]: 62: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,365 INFO L273 TraceCheckUtils]: 63: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,365 INFO L273 TraceCheckUtils]: 64: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,366 INFO L273 TraceCheckUtils]: 65: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,367 INFO L273 TraceCheckUtils]: 66: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,368 INFO L273 TraceCheckUtils]: 67: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,369 INFO L273 TraceCheckUtils]: 68: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,369 INFO L273 TraceCheckUtils]: 69: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~k~0 % 4294967296 < 1048576); {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,370 INFO L273 TraceCheckUtils]: 70: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,371 INFO L273 TraceCheckUtils]: 71: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !(~j~0 % 4294967296 < 1048576); {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2018-11-23 13:16:45,372 INFO L273 TraceCheckUtils]: 72: Hoare triple {3663#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,372 INFO L273 TraceCheckUtils]: 73: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,373 INFO L273 TraceCheckUtils]: 74: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,374 INFO L273 TraceCheckUtils]: 75: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,392 INFO L273 TraceCheckUtils]: 76: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,406 INFO L273 TraceCheckUtils]: 77: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,414 INFO L273 TraceCheckUtils]: 78: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,429 INFO L273 TraceCheckUtils]: 79: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,429 INFO L273 TraceCheckUtils]: 80: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,430 INFO L273 TraceCheckUtils]: 81: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !(~k~0 % 4294967296 < 1048576); {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,430 INFO L273 TraceCheckUtils]: 82: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,431 INFO L273 TraceCheckUtils]: 83: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,431 INFO L273 TraceCheckUtils]: 84: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,432 INFO L273 TraceCheckUtils]: 85: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,432 INFO L273 TraceCheckUtils]: 86: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,433 INFO L273 TraceCheckUtils]: 87: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,434 INFO L273 TraceCheckUtils]: 88: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,435 INFO L273 TraceCheckUtils]: 89: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,436 INFO L273 TraceCheckUtils]: 90: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !(~k~0 % 4294967296 < 1048576); {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,436 INFO L273 TraceCheckUtils]: 91: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,437 INFO L273 TraceCheckUtils]: 92: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} assume !(~j~0 % 4294967296 < 1048576); {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 13:16:45,438 INFO L273 TraceCheckUtils]: 93: Hoare triple {3664#(and (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,439 INFO L273 TraceCheckUtils]: 94: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,439 INFO L273 TraceCheckUtils]: 95: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,440 INFO L273 TraceCheckUtils]: 96: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,441 INFO L273 TraceCheckUtils]: 97: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,442 INFO L273 TraceCheckUtils]: 98: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,443 INFO L273 TraceCheckUtils]: 99: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,444 INFO L273 TraceCheckUtils]: 100: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,445 INFO L273 TraceCheckUtils]: 101: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,446 INFO L273 TraceCheckUtils]: 102: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !(~k~0 % 4294967296 < 1048576); {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,446 INFO L273 TraceCheckUtils]: 103: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,447 INFO L273 TraceCheckUtils]: 104: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,448 INFO L273 TraceCheckUtils]: 105: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,449 INFO L273 TraceCheckUtils]: 106: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,450 INFO L273 TraceCheckUtils]: 107: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,451 INFO L273 TraceCheckUtils]: 108: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,452 INFO L273 TraceCheckUtils]: 109: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,452 INFO L273 TraceCheckUtils]: 110: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,453 INFO L273 TraceCheckUtils]: 111: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !(~k~0 % 4294967296 < 1048576); {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,454 INFO L273 TraceCheckUtils]: 112: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,455 INFO L273 TraceCheckUtils]: 113: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} assume !(~j~0 % 4294967296 < 1048576); {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} is VALID [2018-11-23 13:16:45,456 INFO L273 TraceCheckUtils]: 114: Hoare triple {3665#(and (<= 4 main_~i~0) (<= main_~i~0 4))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3666#(and (<= main_~i~0 5) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:16:45,456 INFO L273 TraceCheckUtils]: 115: Hoare triple {3666#(and (<= main_~i~0 5) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:16:45,457 INFO L273 TraceCheckUtils]: 116: Hoare triple {3660#false} assume 0 != ~a~0 % 4294967296; {3660#false} is VALID [2018-11-23 13:16:45,457 INFO L273 TraceCheckUtils]: 117: Hoare triple {3660#false} assume !false; {3660#false} is VALID [2018-11-23 13:16:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1532 backedges. 0 proven. 1267 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-11-23 13:16:45,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:45,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:45,492 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:17:46,033 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 13:17:46,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:46,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:46,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {3659#true} call ULTIMATE.init(); {3659#true} is VALID [2018-11-23 13:17:46,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {3659#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(1048576);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#array~0.base);call write~unchecked~int(1, ~#array~0.base, ~#array~0.offset, 1); {3659#true} is VALID [2018-11-23 13:17:46,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {3659#true} assume true; {3659#true} is VALID [2018-11-23 13:17:46,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3659#true} {3659#true} #52#return; {3659#true} is VALID [2018-11-23 13:17:46,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {3659#true} call #t~ret6 := main(#in~argc, #in~argv.base, #in~argv.offset); {3659#true} is VALID [2018-11-23 13:17:46,820 INFO L273 TraceCheckUtils]: 5: Hoare triple {3659#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;~a~0 := 1;havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0; {3659#true} is VALID [2018-11-23 13:17:46,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {3659#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3659#true} is VALID [2018-11-23 13:17:46,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {3659#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3659#true} is VALID [2018-11-23 13:17:46,821 INFO L273 TraceCheckUtils]: 8: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,822 INFO L273 TraceCheckUtils]: 14: Hoare triple {3659#true} assume !(~k~0 % 4294967296 < 1048576); {3659#true} is VALID [2018-11-23 13:17:46,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {3659#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3659#true} is VALID [2018-11-23 13:17:46,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {3659#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3659#true} is VALID [2018-11-23 13:17:46,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,823 INFO L273 TraceCheckUtils]: 20: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,823 INFO L273 TraceCheckUtils]: 21: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {3659#true} assume !(~k~0 % 4294967296 < 1048576); {3659#true} is VALID [2018-11-23 13:17:46,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {3659#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3659#true} is VALID [2018-11-23 13:17:46,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {3659#true} assume !(~j~0 % 4294967296 < 1048576); {3659#true} is VALID [2018-11-23 13:17:46,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {3659#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3659#true} is VALID [2018-11-23 13:17:46,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {3659#true} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3659#true} is VALID [2018-11-23 13:17:46,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {3659#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3659#true} is VALID [2018-11-23 13:17:46,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {3659#true} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3659#true} is VALID [2018-11-23 13:17:46,824 INFO L273 TraceCheckUtils]: 34: Hoare triple {3659#true} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3659#true} is VALID [2018-11-23 13:17:46,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {3659#true} assume !(~k~0 % 4294967296 < 1048576); {3659#true} is VALID [2018-11-23 13:17:46,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {3659#true} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3659#true} is VALID [2018-11-23 13:17:46,825 INFO L273 TraceCheckUtils]: 37: Hoare triple {3659#true} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3781#(= main_~k~0 0)} is VALID [2018-11-23 13:17:46,825 INFO L273 TraceCheckUtils]: 38: Hoare triple {3781#(= main_~k~0 0)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3781#(= main_~k~0 0)} is VALID [2018-11-23 13:17:46,826 INFO L273 TraceCheckUtils]: 39: Hoare triple {3781#(= main_~k~0 0)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3788#(= main_~k~0 1)} is VALID [2018-11-23 13:17:46,826 INFO L273 TraceCheckUtils]: 40: Hoare triple {3788#(= main_~k~0 1)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3788#(= main_~k~0 1)} is VALID [2018-11-23 13:17:46,826 INFO L273 TraceCheckUtils]: 41: Hoare triple {3788#(= main_~k~0 1)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3795#(= main_~k~0 2)} is VALID [2018-11-23 13:17:46,827 INFO L273 TraceCheckUtils]: 42: Hoare triple {3795#(= main_~k~0 2)} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3795#(= main_~k~0 2)} is VALID [2018-11-23 13:17:46,827 INFO L273 TraceCheckUtils]: 43: Hoare triple {3795#(= main_~k~0 2)} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3802#(= main_~k~0 3)} is VALID [2018-11-23 13:17:46,828 INFO L273 TraceCheckUtils]: 44: Hoare triple {3802#(= main_~k~0 3)} assume !(~k~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,828 INFO L273 TraceCheckUtils]: 45: Hoare triple {3660#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3660#false} is VALID [2018-11-23 13:17:46,828 INFO L273 TraceCheckUtils]: 46: Hoare triple {3660#false} assume !(~j~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,828 INFO L273 TraceCheckUtils]: 47: Hoare triple {3660#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3660#false} is VALID [2018-11-23 13:17:46,828 INFO L273 TraceCheckUtils]: 48: Hoare triple {3660#false} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,828 INFO L273 TraceCheckUtils]: 49: Hoare triple {3660#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,828 INFO L273 TraceCheckUtils]: 50: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,828 INFO L273 TraceCheckUtils]: 51: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,829 INFO L273 TraceCheckUtils]: 52: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,829 INFO L273 TraceCheckUtils]: 53: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,829 INFO L273 TraceCheckUtils]: 54: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,829 INFO L273 TraceCheckUtils]: 55: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,829 INFO L273 TraceCheckUtils]: 56: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,829 INFO L273 TraceCheckUtils]: 57: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,829 INFO L273 TraceCheckUtils]: 58: Hoare triple {3660#false} assume !(~k~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,829 INFO L273 TraceCheckUtils]: 59: Hoare triple {3660#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3660#false} is VALID [2018-11-23 13:17:46,830 INFO L273 TraceCheckUtils]: 60: Hoare triple {3660#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,830 INFO L273 TraceCheckUtils]: 61: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,830 INFO L273 TraceCheckUtils]: 62: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,830 INFO L273 TraceCheckUtils]: 63: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,830 INFO L273 TraceCheckUtils]: 64: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,830 INFO L273 TraceCheckUtils]: 65: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,831 INFO L273 TraceCheckUtils]: 66: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,831 INFO L273 TraceCheckUtils]: 67: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,831 INFO L273 TraceCheckUtils]: 68: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,831 INFO L273 TraceCheckUtils]: 69: Hoare triple {3660#false} assume !(~k~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,832 INFO L273 TraceCheckUtils]: 70: Hoare triple {3660#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3660#false} is VALID [2018-11-23 13:17:46,832 INFO L273 TraceCheckUtils]: 71: Hoare triple {3660#false} assume !(~j~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,832 INFO L273 TraceCheckUtils]: 72: Hoare triple {3660#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3660#false} is VALID [2018-11-23 13:17:46,832 INFO L273 TraceCheckUtils]: 73: Hoare triple {3660#false} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,832 INFO L273 TraceCheckUtils]: 74: Hoare triple {3660#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,832 INFO L273 TraceCheckUtils]: 75: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,832 INFO L273 TraceCheckUtils]: 76: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,832 INFO L273 TraceCheckUtils]: 77: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 78: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 79: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 80: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 81: Hoare triple {3660#false} assume !(~k~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 82: Hoare triple {3660#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 83: Hoare triple {3660#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 84: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 85: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,833 INFO L273 TraceCheckUtils]: 86: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,834 INFO L273 TraceCheckUtils]: 87: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,834 INFO L273 TraceCheckUtils]: 88: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,834 INFO L273 TraceCheckUtils]: 89: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,834 INFO L273 TraceCheckUtils]: 90: Hoare triple {3660#false} assume !(~k~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,834 INFO L273 TraceCheckUtils]: 91: Hoare triple {3660#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3660#false} is VALID [2018-11-23 13:17:46,834 INFO L273 TraceCheckUtils]: 92: Hoare triple {3660#false} assume !(~j~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,834 INFO L273 TraceCheckUtils]: 93: Hoare triple {3660#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3660#false} is VALID [2018-11-23 13:17:46,834 INFO L273 TraceCheckUtils]: 94: Hoare triple {3660#false} assume !!(~i~0 % 4294967296 < 1048576);~j~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,835 INFO L273 TraceCheckUtils]: 95: Hoare triple {3660#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,835 INFO L273 TraceCheckUtils]: 96: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,835 INFO L273 TraceCheckUtils]: 97: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,835 INFO L273 TraceCheckUtils]: 98: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,835 INFO L273 TraceCheckUtils]: 99: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,835 INFO L273 TraceCheckUtils]: 100: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,835 INFO L273 TraceCheckUtils]: 101: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,835 INFO L273 TraceCheckUtils]: 102: Hoare triple {3660#false} assume !(~k~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,836 INFO L273 TraceCheckUtils]: 103: Hoare triple {3660#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3660#false} is VALID [2018-11-23 13:17:46,836 INFO L273 TraceCheckUtils]: 104: Hoare triple {3660#false} assume !!(~j~0 % 4294967296 < 1048576);~k~0 := 0; {3660#false} is VALID [2018-11-23 13:17:46,836 INFO L273 TraceCheckUtils]: 105: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,836 INFO L273 TraceCheckUtils]: 106: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,836 INFO L273 TraceCheckUtils]: 107: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,836 INFO L273 TraceCheckUtils]: 108: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,836 INFO L273 TraceCheckUtils]: 109: Hoare triple {3660#false} assume !!(~k~0 % 4294967296 < 1048576);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + (if ~k~0 % 4294967296 % 4294967296 <= 2147483647 then ~k~0 % 4294967296 % 4294967296 else ~k~0 % 4294967296 % 4294967296 - 4294967296), 1);call write~int((if (#t~mem3 + #t~mem4) % 256 <= 127 then (#t~mem3 + #t~mem4) % 256 else (#t~mem3 + #t~mem4) % 256 - 256), ~#array~0.base, ~#array~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~mem4;havoc #t~mem3; {3660#false} is VALID [2018-11-23 13:17:46,836 INFO L273 TraceCheckUtils]: 110: Hoare triple {3660#false} #t~post2 := ~k~0;~k~0 := 1 + #t~post2;havoc #t~post2; {3660#false} is VALID [2018-11-23 13:17:46,837 INFO L273 TraceCheckUtils]: 111: Hoare triple {3660#false} assume !(~k~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,837 INFO L273 TraceCheckUtils]: 112: Hoare triple {3660#false} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3660#false} is VALID [2018-11-23 13:17:46,837 INFO L273 TraceCheckUtils]: 113: Hoare triple {3660#false} assume !(~j~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,837 INFO L273 TraceCheckUtils]: 114: Hoare triple {3660#false} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3660#false} is VALID [2018-11-23 13:17:46,837 INFO L273 TraceCheckUtils]: 115: Hoare triple {3660#false} assume !(~i~0 % 4294967296 < 1048576); {3660#false} is VALID [2018-11-23 13:17:46,837 INFO L273 TraceCheckUtils]: 116: Hoare triple {3660#false} assume 0 != ~a~0 % 4294967296; {3660#false} is VALID [2018-11-23 13:17:46,838 INFO L273 TraceCheckUtils]: 117: Hoare triple {3660#false} assume !false; {3660#false} is VALID [2018-11-23 13:17:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1532 backedges. 814 proven. 9 refuted. 0 times theorem prover too weak. 709 trivial. 0 not checked. [2018-11-23 13:17:46,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:46,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 13:17:46,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2018-11-23 13:17:46,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:46,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:17:47,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:47,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:17:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:17:47,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:17:47,019 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 12 states. [2018-11-23 13:17:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:49,673 INFO L93 Difference]: Finished difference Result 302 states and 350 transitions. [2018-11-23 13:17:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 13:17:49,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2018-11-23 13:17:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:17:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 139 transitions. [2018-11-23 13:17:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:17:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 139 transitions. [2018-11-23 13:17:49,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 139 transitions. [2018-11-23 13:17:49,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:49,900 INFO L225 Difference]: With dead ends: 302 [2018-11-23 13:17:49,900 INFO L226 Difference]: Without dead ends: 198 [2018-11-23 13:17:49,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:17:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-11-23 13:17:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 160. [2018-11-23 13:17:50,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:50,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand 160 states. [2018-11-23 13:17:50,617 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 160 states. [2018-11-23 13:17:50,617 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 160 states. [2018-11-23 13:17:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:50,624 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2018-11-23 13:17:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2018-11-23 13:17:50,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:50,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:50,625 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 198 states. [2018-11-23 13:17:50,625 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 198 states. [2018-11-23 13:17:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:50,632 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2018-11-23 13:17:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2018-11-23 13:17:50,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:50,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:50,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:50,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 13:17:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 178 transitions. [2018-11-23 13:17:50,639 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 178 transitions. Word has length 118 [2018-11-23 13:17:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:50,639 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 178 transitions. [2018-11-23 13:17:50,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:17:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2018-11-23 13:17:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 13:17:50,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:50,641 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 12, 12, 12, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:50,641 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:50,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash -37700163, now seen corresponding path program 6 times [2018-11-23 13:17:50,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:50,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:50,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:17:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY